Encoder, decoder, encoding method, and decoding method

ABSTRACT

A decoder comprises circuitry and memory. The circuitry, using the memory, in operation, determines a number of first pixels and a number of second pixels used in a deblocking filter process, wherein the first pixels are located at an upper side of a block boundary and the second pixels are located at a lower side of the block boundary, and performs the deblocking filter process on the block boundary. The number of the first pixels and the number of the second pixels are selected from among candidates, wherein the candidates include at least 4 and M larger than 4. Response to a location of the block boundary being a predetermined location, the number of the first pixels used in the deblocking filter process is limited to be 4.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. continuation application of U.S. patentapplication Ser. No. 17/227,015, filed Apr. 9, 2021, which is a U.S.continuation application of U.S. patent application Ser. No. 16/809,216,filed Mar. 4, 2020, which is a U.S. continuation application of PCTInternational Patent Application Number PCT/JP2019/019453 filed on May16, 2019, claiming the benefit of priority of U.S. Provisional PatentApplication No. 62/675,303 filed on May 23, 2018, the entire contents ofwhich are hereby incorporated by reference.

BACKGROUND 1. Technical Field

The present disclosure relates to an encoder, a decoder, an encodingmethod, and a decoding method.

2. Description of the Related Art

Conventionally, H.265 has been known as standards for encoding movingpictures. H.265 is also referred to as High-Efficiency Video Coding(HEVC) (H.265 (ISO/IEC 23008-2 HEVC)/HEVC.

SUMMARY

An encoder according to one aspect of the present disclosure includescircuitry and memory. Using the memory, the circuitry determines afilter to be used for deblocking filtering from among a plurality offilters including a first filter and a second filter, and performs thedeblocking filtering on a block boundary using the filter determined.The first filter uses M pixels located at an upper side of the blockboundary and M pixels located at a lower side of the block boundary, Mbeing an integer of at least 2. The second filter uses first pixelslocated at the upper side of the block boundary and second pixelslocated at the lower side of the block boundary. The number of the firstpixels is any one of a plurality of first candidate values, and thenumber of the second pixels is any one of a plurality of secondcandidate values. The plurality of first pixel candidate values and theplurality of second pixel candidate values are each a value greater thanor equal to M. The largest possible value for the number of the firstpixels is determined according to whether a location of the blockboundary is a predetermined location.

A decoder according to one aspect of the present disclosure includescircuitry and memory. Using the memory, the circuitry determines afilter to be used for deblocking filtering from among a plurality offilters including a first filter and a second filter, and performs thedeblocking filtering on a block boundary using the filter determined.The first filter uses M pixels located at an upper side of the blockboundary and M pixels located at a lower side of the block boundary, Mbeing an integer of at least 2. The second filter uses first pixelslocated at the upper side of the block boundary and second pixelslocated at the lower side of the block boundary. The number of the firstpixels is any one of a plurality of first candidate values, and thenumber of the second pixels is any one of a plurality of secondcandidate values. The plurality of first pixel candidate values and theplurality of second pixel candidate values are each a value greater thanor equal to M. The largest possible value for the number of the firstpixels is determined according to whether a location of the blockboundary is a predetermined location.

General or specific aspects of the present disclosure may be realized asa system, method, integrated circuit, computer program,computer-readable medium such as a CD-ROM, or any given combinationthereof.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the disclosure willbecome apparent from the following description thereof taken inconjunction with the accompanying drawings that illustrate a specificembodiment of the present disclosure.

FIG. 1 is a block diagram illustrating a functional configuration of anencoder according to Embodiment 1;

FIG. 2 illustrates one example of block splitting according toEmbodiment 1;

FIG. 3 is a chart indicating transform basis functions for eachtransform type;

FIG. 4A illustrates one example of a filter shape used in ALF;

FIG. 4B illustrates another example of a filter shape used in ALF;

FIG. 4C illustrates another example of a filter shape used in ALF;

FIG. 5A illustrates 67 intra prediction modes used in intra prediction;

FIG. 5B is a flow chart for illustrating an outline of a predictionimage correction process performed via OBMC processing;

FIG. 5C is a conceptual diagram for illustrating an outline of aprediction image correction process performed via OBMC processing;

FIG. 5D illustrates one example of FRUC;

FIG. 6 is for illustrating pattern matching (bilateral matching) betweentwo blocks along a motion trajectory;

FIG. 7 is for illustrating pattern matching (template matching) betweena template in the current picture and a block in a reference picture;

FIG. 8 is for illustrating a model assuming uniform linear motion;

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks;

FIG. 9B is for illustrating an outline of a process for deriving amotion vector via merge mode;

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing;

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing;

FIG. 10 is a block diagram illustrating a functional configuration of adecoder according to Embodiment 1;

FIG. 11 is a flowchart illustrating deblocking filtering according toEmbodiment 1;

FIG. 12 illustrates an example of filter candidates according toEmbodiment 1;

FIG. 13 is a flowchart illustrating a process of determining filtercandidates according to the first aspect of Embodiment 1;

FIG. 14 illustrates an example of filter candidates including anasymmetric filter according to the first aspect of Embodiment 1;

FIG. 15 is a flowchart illustrating a process of determining filtercandidates according to the second aspect of Embodiment 1;

FIG. 16 illustrates an example of filter candidates including a filterfor filtering including extrapolation according to the second aspect ofEmbodiment 1;

FIG. 17 is a block diagram illustrating an example of implementation ofan encoder;

FIG. 18 is a block diagram illustrating an example of implementation ofa decoder;

FIG. 19 illustrates an overall configuration of a content providingsystem for implementing a content distribution service;

FIG. 20 illustrates one example of an encoding structure in scalableencoding;

FIG. 21 illustrates one example of an encoding structure in scalableencoding;

FIG. 22 illustrates an example of a display screen of a web page;

FIG. 23 illustrates an example of a display screen of a web page;

FIG. 24 illustrates one example of a smartphone; and

FIG. 25 is a block diagram illustrating a configuration example of asmartphone.

DETAILED DESCRIPTION OF THE EMBODIMENTS

An encoder according to one aspect of the present disclosure includescircuitry and memory. Using the memory, the circuitry: determines afilter to be used for deblocking filtering from among a plurality offilters including a first filter and a second filter; and performs thedeblocking filtering on a block boundary using the filter determined.The first filter uses M pixels located at an upper side of the blockboundary and M pixels located at a lower side of the block boundary, Mbeing an integer of at least 2. The second filter uses first pixelslocated at the upper side of the block boundary and second pixelslocated at the lower side of the block boundary. The number of the firstpixels is any one of a plurality of first candidate values, and thenumber of the second pixels is any one of a plurality of secondcandidate values. The plurality of first pixel candidate values and theplurality of second pixel candidate values are each a value greater thanor equal to M.

According to this, the encoder is capable of reducing the number ofpixels located at the upper or left side of the block boundary which areused for deblocking filtering. The encoder may therefore be capable ofreducing the amount of data stored in the memory. The pixels located atthe left side of the block boundary may be used instead of the pixelslocated at the upper side of the block boundary, and the pixels locatedat the right side of the block boundary may be used instead of thepixels located at the lower side of the block boundary.

For example, cases for the second filter may be as follows: a case wherethe number of the first pixels is same as the number of the secondpixels; and a case where the number of the first pixels is differentfrom the number of the second pixels.

For example, the plurality of first candidate values and the pluralityof second candidate values may be each a value greater than or equal to4.

For example, among the plurality of filters, a filter other than thesecond filter may use a same number of pixels located at the upper sideof the block boundary and pixels located at the lower side of the blockboundary. For example, the largest possible value for the number of thefirst pixels may be determined according to whether a location of theblock boundary is a predetermined location.

For example, the predetermined location may be an upper edge of a codingtree unit (CTU).

When the second filter is applied to both a vertical boundary and ahorizontal boundary, the number of pixels to be used by the secondfilter may be limited only for the vertical boundary or for the both ofthe vertical and horizontal boundaries. Stated differently, thepredetermined position may be exclusively determined to be the upperedge of a CTU or may be determined to be either the upper or lower edgeof the CTU.

For example, the predetermined location may be an upper edge of a codingunit (CU).

When the second filter is applied to both a vertical boundary and ahorizontal boundary, the number of pixels to be used by the secondfilter may be limited only for the vertical boundary or for the both ofthe vertical and horizontal boundaries. Stated differently, thepredetermined position may be exclusively determined to be the upperedge of a CU or may be determined to be either the upper or lower edgeof the CU.

For example, the largest possible value for the number of the firstpixels may be at most the number of pixels that are located at the upperside of the block boundary and are used by a filter using a secondlargest number of pixels after the second filter among the plurality offilters.

For example, the largest possible value for the number of the firstpixels may be at most the number of pixels that are located at the upperside of the block boundary and are used in a process using a largestnumber of pixels located at the upper side among processes which areincluded in loop filtering including the deblocking filtering and fromwhich a process using the second filter is excluded.

For example, in the case where the number of the first pixels isdifferent from the number of the second pixels, a filter tap-length onone side of the block boundary may be different from a filter tap-lengthon the other side of the block boundary.

For example, in the case where the number of the first pixels isdifferent from the number of the second pixels, the second filter may:generate third pixels that are sequentially located above the firstpixels, using the first pixels; and use the first pixels, the secondpixels, and the third pixels. A sum of the number of the first pixelsand the number of the third pixels may equal to the number of the secondpixels.

A decoder according to one aspect of the present disclosure includescircuitry and memory. Using the memory, the circuitry determines afilter to be used for deblocking filtering from among a plurality offilters including a first filter and a second filter, and performs thedeblocking filtering on a block boundary using the filter determined.The first filter uses M pixels located at an upper side of the blockboundary and M pixels located at a lower side of the block boundary, Mbeing an integer of at least 2. The second filter uses first pixelslocated at the upper side of the block boundary and second pixelslocated at the lower side of the block boundary. The number of the firstpixels is any one of a plurality of first candidate values, and thenumber of the second pixels is any one of a plurality of secondcandidate values. The plurality of first pixel candidate values and theplurality of second pixel candidate values are each a value greater thanor equal to M.

According to this, the decoder is capable of reducing the number ofpixels located at the upper or left side of the block boundary which areused for deblocking filtering. The decoder may therefore be capable ofreducing the amount of data stored in the memory.

For example, cases for the second filter may be as follows: a case wherethe number of the first pixels is same as the number of the secondpixels; and a case where the number of the first pixels is differentfrom the number of the second pixels.

For example, the plurality of first candidate values and the pluralityof second candidate values may be each a value greater than or equal to4.

For example, among the plurality of filters, a filter other than thesecond filter may use a same number of pixels located at the upper sideof the block boundary and pixels located at the lower side of the blockboundary. For example, the largest possible value for the number of thefirst pixels may be determined according to whether a location of theblock boundary is a predetermined location.

For example, the predetermined location may be an upper edge of a codingtree unit (CTU).

When the second filter is applied to both a vertical boundary and ahorizontal boundary, the number of pixels to be used by the secondfilter may be limited only for the vertical boundary or for the both ofthe vertical and horizontal boundaries. Stated differently, thepredetermined position may be exclusively determined to be the upperedge of a CTU or may be determined to be either the upper or lower edgeof the CTU.

For example, the predetermined location may be an upper edge of a codingunit (CU).

When the second filter is applied to both a vertical boundary and ahorizontal boundary, the number of pixels to be used by the secondfilter may be limited only for the vertical boundary or for the both ofthe vertical and horizontal boundaries. Stated differently, thepredetermined position may be exclusively determined to be the upperedge of a CU or may be determined to be either the upper or lower edgeof the CU.

For example, the largest possible value for the number of the firstpixels may be at most the number of pixels that are located at the upperside of the block boundary and are used by a filter using a secondlargest number of pixels after the second filter among the plurality offilters.

For example, the largest possible value for the number of the firstpixels may be at most the number of pixels that are located at the upperside of the block boundary and are used in a process using a largestnumber of pixels located at the upper side among processes which areincluded in loop filtering including the deblocking filtering and fromwhich a process using the second filter is excluded.

For example, in the case where the number of the first pixels isdifferent from the number of the second pixels, a filter tap-length onone side of the block boundary may be different from a filter tap-lengthon the other side of the block boundary.

For example, in the case where the number of the first pixels isdifferent from the number of the second pixels, the second filter may:generate third pixels that are sequentially located above the firstpixels, using the first pixels; and use the first pixels, the secondpixels, and the third pixels. A sum of the number of the first pixelsand the number of the third pixels may equal to the number of the secondpixels.

An encoding method according to one aspect of the present disclosureincludes: determining a filter to be used for deblocking filtering fromamong a plurality of filters including a first filter and a secondfilter; and performing the deblocking filtering on a block boundaryusing the filter determined. The first filter uses M pixels located atan upper side of the block boundary and M pixels located at a lower sideof the block boundary, M being an integer of at least 2. The secondfilter uses first pixels located at the upper side of the block boundaryand second pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of the second pixels is any one of a plurality ofsecond candidate values. The plurality of first pixel candidate valuesand the plurality of second pixel candidate values are each a valuegreater than or equal to M.

According to this, the encoding method is capable of reducing the numberof pixels located at the upper or left side of the block boundary whichare used for deblocking filtering. The encoding method may therefore becapable of reducing the amount of data stored in the memory.

A decoding method according to one aspect of the present disclosureincludes: determining a filter to be used for deblocking filtering fromamong a plurality of filters including a first filter and a secondfilter; and performing the deblocking filtering on a block boundaryusing the filter determined. The first filter uses M pixels located atan upper side of the block boundary and M pixels located at a lower sideof the block boundary, M being an integer of at least 2. The secondfilter uses first pixels located at the upper side of the block boundaryand second pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of the second pixels is any one of a plurality ofsecond candidate values. The plurality of first pixel candidate valuesand the plurality of second pixel candidate values are each a valuegreater than or equal to M.

According to this, the decoding method is capable of reducing the numberof pixels located at the upper or left side of the block boundary whichare used for deblocking filtering. The decoding method may therefore becapable of reducing the amount of data stored in the memory.

Moreover, these general or specific aspects of the present disclosuremay be realized as a system, device, method, integrated circuit,computer program, non-transitory computer-readable medium such as aCD-ROM, or any given combination thereof.

Hereinafter, embodiments will be described with reference to thedrawings.

Note that the embodiments described below each show a general orspecific example. The numerical values, shapes, materials, components,the arrangement and connection of the components, steps, order of thesteps, etc. that are indicated in the following embodiments are mereexamples, and therefore are not intended to limit the scope of theclaims. Therefore, among the components in the following embodiments,those not recited in any of the independent claims defining the broadestinventive concepts are described as optional components.

Embodiment 1

First, an outline of Embodiment 1 will be presented. Embodiment 1 is oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in subsequent description of aspects of thepresent disclosure are applicable. Note that Embodiment 1 is merely oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in the description of aspects of the presentdisclosure are applicable. The processes and/or configurations presentedin the description of aspects of the present disclosure can also beimplemented in an encoder and a decoder different from those accordingto Embodiment 1.

When the processes and/or configurations presented in the description ofaspects of the present disclosure are applied to Embodiment 1, forexample, any of the following may be performed.

(1) regarding the encoder or the decoder according to Embodiment 1,among components included in the encoder or the decoder according toEmbodiment 1, substituting a component corresponding to a componentpresented in the description of aspects of the present disclosure with acomponent presented in the description of aspects of the presentdisclosure;

(2) regarding the encoder or the decoder according to Embodiment 1,implementing discretionary changes to functions or implemented processesperformed by one or more components included in the encoder or thedecoder according to Embodiment 1, such as addition, substitution, orremoval, etc., of such functions or implemented processes, thensubstituting a component corresponding to a component presented in thedescription of aspects of the present disclosure with a componentpresented in the description of aspects of the present disclosure;

(3) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, implementing discretionary changes such asaddition of processes and/or substitution, removal of one or more of theprocesses included in the method, and then substituting a processcorresponding to a process presented in the description of aspects ofthe present disclosure with a process presented in the description ofaspects of the present disclosure;

(4) combining one or more components included in the encoder or thedecoder according to Embodiment 1 with a component presented in thedescription of aspects of the present disclosure, a component includingone or more functions included in a component presented in thedescription of aspects of the present disclosure, or a component thatimplements one or more processes implemented by a component presented inthe description of aspects of the present disclosure;

(5) combining a component including one or more functions included inone or more components included in the encoder or the decoder accordingto Embodiment 1, or a component that implements one or more processesimplemented by one or more components included in the encoder or thedecoder according to Embodiment 1 with a component presented in thedescription of aspects of the present disclosure, a component includingone or more functions included in a component presented in thedescription of aspects of the present disclosure, or a component thatimplements one or more processes implemented by a component presented inthe description of aspects of the present disclosure;

(6) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, among processes included in the method,substituting a process corresponding to a process presented in thedescription of aspects of the present disclosure with a processpresented in the description of aspects of the present disclosure; and

(7) combining one or more processes included in the method implementedby the encoder or the decoder according to Embodiment 1 with a processpresented in the description of aspects of the present disclosure.

Note that the implementation of the processes and/or configurationspresented in the description of aspects of the present disclosure is notlimited to the above examples. For example, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be implemented in a device used for a purpose differentfrom the moving picture/picture encoder or the moving picture/picturedecoder disclosed in Embodiment 1. Moreover, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be independently implemented. Moreover, processes and/orconfigurations described in different aspects may be combined.

[Encoder Outline]

First, the encoder according to Embodiment 1 will be outlined. FIG. 1 isa block diagram illustrating a functional configuration of encoder 100according to Embodiment 1. Encoder 100 is a moving picture/pictureencoder that encodes a moving picture/picture block by block.

As illustrated in FIG. 1 , encoder 100 is a device that encodes apicture block by block, and includes splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, block memory 118, loop filter120, frame memory 122, intra predictor 124, inter predictor 126, andprediction controller 128.

Encoder 100 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as splitter 102, subtractor104, transformer 106, quantizer 108, entropy encoder 110, inversequantizer 112, inverse transformer 114, adder 116, loop filter 120,intra predictor 124, inter predictor 126, and prediction controller 128.Alternatively, encoder 100 may be realized as one or more dedicatedelectronic circuits corresponding to splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, loop filter 120, intrapredictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, each component included in encoder 100 will be described.

[Splitter]

Splitter 102 splits each picture included in an input moving pictureinto blocks, and outputs each block to subtractor 104. For example,splitter 102 first splits a picture into blocks of a fixed size (forexample, 128×128). The fixed size block is also referred to as codingtree unit (CTU). Splitter 102 then splits each fixed size block intoblocks of variable sizes (for example, 64×64 or smaller), based onrecursive quadtree and/or binary tree block splitting. The variable sizeblock is also referred to as a coding unit (CU), a prediction unit (PU),or a transform unit (TU). Note that in this embodiment, there is no needto differentiate between CU, PU, and TU; all or some of the blocks in apicture may be processed per CU, PU, or TU.

FIG. 2 illustrates one example of block splitting according toEmbodiment 1. In FIG. 2 , the solid lines represent block boundaries ofblocks split by quadtree block splitting, and the dashed lines representblock boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square 128×128 pixel block (128×128 block). This128×128 block 10 is first split into four square 64×64 blocks (quadtreeblock splitting).

The top left 64×64 block is further vertically split into two rectangle32×64 blocks, and the left 32×64 block is further vertically split intotwo rectangle 16×64 blocks (binary tree block splitting). As a result,the top left 64×64 block is split into two 16×64 blocks 11 and 12 andone 32×64 block 13.

The top right 64×64 block is horizontally split into two rectangle 64×32blocks 14 and 15 (binary tree block splitting).

The bottom left 64×64 block is first split into four square 32×32 blocks(quadtree block splitting). The top left block and the bottom rightblock among the four 32×32 blocks are further split. The top left 32×32block is vertically split into two rectangle 16×32 blocks, and the right16×32 block is further horizontally split into two 16×16 blocks (binarytree block splitting). The bottom right 32×32 block is horizontallysplit into two 32×16 blocks (binary tree block splitting). As a result,the bottom left 64×64 block is split into 16×32 block 16, two 16×16blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21and 22.

The bottom right 64×64 block 23 is not split.

As described above, in FIG. 2 , block 10 is split into 13 variable sizeblocks 11 through 23 based on recursive quadtree and binary tree blocksplitting. This type of splitting is also referred to as quadtree plusbinary tree (QTBT) splitting.

Note that in FIG. 2 , one block is split into four or two blocks(quadtree or binary tree block splitting), but splitting is not limitedto this example. For example, one block may be split into three blocks(ternary block splitting). Splitting including such ternary blocksplitting is also referred to as multi-type tree (MBT) splitting.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample) from anoriginal signal (original sample) per block split by splitter 102. Inother words, subtractor 104 calculates prediction errors (also referredto as residuals) of a block to be encoded (hereinafter referred to as acurrent block). Subtractor 104 then outputs the calculated predictionerrors to transformer 106.

The original signal is a signal input into encoder 100, and is a signalrepresenting an image for each picture included in a moving picture (forexample, a luma signal and two chroma signals). Hereinafter, a signalrepresenting an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms spatial domain prediction errors intofrequency domain transform coefficients, and outputs the transformcoefficients to quantizer 108. More specifically, transformer 106applies, for example, a predefined discrete cosine transform (DCT) ordiscrete sine transform (DST) to spatial domain prediction errors.

Note that transformer 106 may adaptively select a transform type fromamong a plurality of transform types, and transform prediction errorsinto transform coefficients by using a transform basis functioncorresponding to the selected transform type. This sort of transform isalso referred to as explicit multiple core transform (EMT) or adaptivemultiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII,DST-I, and DST-VII. FIG. 3 is a chart indicating transform basisfunctions for each transform type. In FIG. 3 , N indicates the number ofinput pixels. For example, selection of a transform type from among theplurality of transform types may depend on the prediction type (intraprediction and inter prediction), and may depend on intra predictionmode.

Information indicating whether to apply such EMT or AMT (referred to as,for example, an AMT flag) and information indicating the selectedtransform type is signalled at the CU level. Note that the signaling ofsuch information need not be performed at the CU level, and may beperformed at another level (for example, at the sequence level, picturelevel, slice level, tile level, or CTU level).

Moreover, transformer 106 may apply a secondary transform to thetransform coefficients (transform result). Such a secondary transform isalso referred to as adaptive secondary transform (AST) or non-separablesecondary transform (NSST). For example, transformer 106 applies asecondary transform to each sub-block (for example, each 4×4 sub-block)included in the block of the transform coefficients corresponding to theintra prediction errors. Information indicating whether to apply NSSTand information related to the transform matrix used in NSST aresignalled at the CU level. Note that the signaling of such informationneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, or CTU level).

Here, a separable transform is a method in which a transform isperformed a plurality of times by separately performing a transform foreach direction according to the number of dimensions input. Anon-separable transform is a method of performing a collective transformin which two or more dimensions in a multidimensional input arecollectively regarded as a single dimension.

In one example of a non-separable transform, when the input is a 4×4block, the 4×4 block is regarded as a single array including 16components, and the transform applies a 16×16 transform matrix to thearray.

Moreover, similar to above, after an input 4×4 block is regarded as asingle array including 16 components, a transform that performs aplurality of Givens rotations on the array (i.e., a Hypercube-GivensTransform) is also one example of a non-separable transform.

[Quantizer]

Quantizer 108 quantizes the transform coefficients output fromtransformer 106. More specifically, quantizer 108 scans, in apredetermined scanning order, the transform coefficients of the currentblock, and quantizes the scanned transform coefficients based onquantization parameters (QP) corresponding to the transformcoefficients. Quantizer 108 then outputs the quantized transformcoefficients (hereinafter referred to as quantized coefficients) of thecurrent block to entropy encoder 110 and inverse quantizer 112.

A predetermined order is an order for quantizing/inverse quantizingtransform coefficients. For example, a predetermined scanning order isdefined as ascending order of frequency (from low to high frequency) ordescending order of frequency (from high to low frequency).

A quantization parameter is a parameter defining a quantization stepsize (quantization width). For example, if the value of the quantizationparameter increases, the quantization step size also increases. In otherwords, if the value of the quantization parameter increases, thequantization error increases.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) byvariable length encoding quantized coefficients, which are inputs fromquantizer 108. More specifically, entropy encoder 110, for example,binarizes quantized coefficients and arithmetic encodes the binarysignal.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients, whichare inputs from quantizer 108. More specifically, inverse quantizer 112inverse quantizes, in a predetermined scanning order, quantizedcoefficients of the current block. Inverse quantizer 112 then outputsthe inverse quantized transform coefficients of the current block toinverse transformer 114.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 112. More specifically, inverse transformer 114 restores theprediction errors of the current block by applying an inverse transformcorresponding to the transform applied by transformer 106 on thetransform coefficients. Inverse transformer 114 then outputs therestored prediction errors to adder 116.

Note that since information is lost in quantization, the restoredprediction errors do not match the prediction errors calculated bysubtractor 104. In other words, the restored prediction errors includequantization errors.

[Adder]

Adder 116 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 114, and prediction samples,which are inputs from prediction controller 128. Adder 116 then outputsthe reconstructed block to block memory 118 and loop filter 120. Areconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is storage for storing blocks in a picture to beencoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 118 storesreconstructed blocks output from adder 116.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder116, and outputs the filtered reconstructed blocks to frame memory 122.A loop filter is a filter used in an encoding loop (in-loop filter), andincludes, for example, a deblocking filter (DF), a sample adaptiveoffset (SAO), and an adaptive loop filter (ALF).

In ALF, a least square error filter for removing compression artifactsis applied. For example, one filter from among a plurality of filters isselected for each 2×2 sub-block in the current block based on directionand activity of local gradients, and is applied.

More specifically, first, each sub-block (for example, each 2×2sub-block) is categorized into one out of a plurality of classes (forexample, 15 or 25 classes). The classification of the sub-block is basedon gradient directionality and activity. For example, classificationindex C is derived based on gradient directionality D (for example, 0 to2 or 0 to 4) and gradient activity A (for example, 0 to 4) (for example,C=5D+A). Then, based on classification index C, each sub-block iscategorized into one out of a plurality of classes (for example, 15 or25 classes).

For example, gradient directionality D is calculated by comparinggradients of a plurality of directions (for example, the horizontal,vertical, and two diagonal directions). Moreover, for example, gradientactivity A is calculated by summing gradients of a plurality ofdirections and quantizing the sum.

The filter to be used for each sub-block is determined from among theplurality of filters based on the result of such categorization.

The filter shape to be used in ALF is, for example, a circular symmetricfilter shape. FIG. 4A through FIG. 4C illustrate examples of filtershapes used in ALF. FIG. 4A illustrates a 5×5 diamond shape filter, FIG.4B illustrates a 7×7 diamond shape filter, and FIG. 4C illustrates a 9×9diamond shape filter. Information indicating the filter shape issignalled at the picture level. Note that the signaling of informationindicating the filter shape need not be performed at the picture level,and may be performed at another level (for example, at the sequencelevel, slice level, tile level, CTU level, or CU level).

The enabling or disabling of ALF is determined at the picture level orCU level. For example, for luma, the decision to apply ALF or not isdone at the CU level, and for chroma, the decision to apply ALF or notis done at the picture level. Information indicating whether ALF isenabled or disabled is signalled at the picture level or CU level. Notethat the signaling of information indicating whether ALF is enabled ordisabled need not be performed at the picture level or CU level, and maybe performed at another level (for example, at the sequence level, slicelevel, tile level, or CTU level).

The coefficients set for the plurality of selectable filters (forexample, 15 or 25 filters) is signalled at the picture level. Note thatthe signaling of the coefficients set need not be performed at thepicture level, and may be performed at another level (for example, atthe sequence level, slice level, tile level, CTU level, CU level, orsub-block level).

[Frame Memory]

Frame memory 122 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 122 stores reconstructed blocks filtered byloop filter 120.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra predictionsignal) by intra predicting the current block with reference to a blockor blocks in the current picture and stored in block memory 118 (alsoreferred to as intra frame prediction). More specifically, intrapredictor 124 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using onemode from among a plurality of predefined intra prediction modes. Theintra prediction modes include one or more non-directional predictionmodes and a plurality of directional prediction modes.

The one or more non-directional prediction modes include, for example,planar prediction mode and DC prediction mode defined in theH.265/high-efficiency video coding (HEVC) standard (see H.265 (ISO/IEC23008-2 HEVC)/HEVC (High Efficiency Video Coding)) (Non-patentLiterature (NPL) 1)).

The plurality of directional prediction modes include, for example, the33 directional prediction modes defined in the H.265/HEVC standard. Notethat the plurality of directional prediction modes may further include32 directional prediction modes in addition to the 33 directionalprediction modes (for a total of 65 directional prediction modes). FIG.5A illustrates 67 intra prediction modes used in intra prediction (twonon-directional prediction modes and 65 directional prediction modes).The solid arrows represent the 33 directions defined in the H.265/HEVCstandard, and the dashed arrows represent the additional 32 directions.

Note that a luma block may be referenced in chroma block intraprediction. In other words, a chroma component of the current block maybe predicted based on a luma component of the current block. Such intraprediction is also referred to as cross-component linear model (CCLM)prediction. Such a chroma block intra prediction mode that references aluma block (referred to as, for example, CCLM mode) may be added as oneof the chroma block intra prediction modes.

Intra predictor 124 may correct post-intra-prediction pixel values basedon horizontal/vertical reference pixel gradients. Intra predictionaccompanied by this sort of correcting is also referred to as positiondependent intra prediction combination (PDPC). Information indicatingwhether to apply PDPC or not (referred to as, for example, a PDPC flag)is, for example, signalled at the CU level. Note that the signaling ofthis information need not be performed at the CU level, and may beperformed at another level (for example, at the sequence level, picturelevel, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter predictionsignal) by inter predicting the current block with reference to a blockor blocks in a reference picture, which is different from the currentpicture and is stored in frame memory 122 (also referred to as interframe prediction). Inter prediction is performed per current block orper sub-block (for example, per 4×4 block) in the current block. Forexample, inter predictor 126 performs motion estimation in a referencepicture for the current block or sub-block. Inter predictor 126 thengenerates an inter prediction signal of the current block or sub-blockby motion compensation by using motion information (for example, amotion vector) obtained from motion estimation. Inter predictor 126 thenoutputs the generated inter prediction signal to prediction controller128.

The motion information used in motion compensation is signalled. Amotion vector predictor may be used for the signaling of the motionvector. In other words, the difference between the motion vector and themotion vector predictor may be signalled.

Note that the inter prediction signal may be generated using motioninformation for a neighboring block in addition to motion informationfor the current block obtained from motion estimation. Morespecifically, the inter prediction signal may be generated per sub-blockin the current block by calculating a weighted sum of a predictionsignal based on motion information obtained from motion estimation and aprediction signal based on motion information for a neighboring block.Such inter prediction (motion compensation) is also referred to asoverlapped block motion compensation (OBMC).

In such an OBMC mode, information indicating sub-block size for OBMC(referred to as, for example, OBMC block size) is signalled at thesequence level. Moreover, information indicating whether to apply theOBMC mode or not (referred to as, for example, an OBMC flag) issignalled at the CU level. Note that the signaling of such informationneed not be performed at the sequence level and CU level, and may beperformed at another level (for example, at the picture level, slicelevel, tile level, CTU level, or sub-block level).

Hereinafter, the OBMC mode will be described in further detail. FIG. 5Bis a flowchart and FIG. 5C is a conceptual diagram for illustrating anoutline of a prediction image correction process performed via OBMCprocessing.

First, a prediction image (Pred) is obtained through typical motioncompensation using a motion vector (MV) assigned to the current block.

Next, a prediction image (Pred_L) is obtained by applying a motionvector (MV_L) of the encoded neighboring left block to the currentblock, and a first pass of the correction of the prediction image ismade by superimposing the prediction image and Pred_L.

Similarly, a prediction image (Pred_U) is obtained by applying a motionvector (MV_U) of the encoded neighboring upper block to the currentblock, and a second pass of the correction of the prediction image ismade by superimposing the prediction image resulting from the first passand Pred_U. The result of the second pass is the final prediction image.

Note that the above example is of a two-pass correction method using theneighboring left and upper blocks, but the method may be a three-pass orhigher correction method that also uses the neighboring right and/orlower block.

Note that the region subjected to superimposition may be the entirepixel region of the block, and, alternatively, may be a partial blockboundary region.

Note that here, the prediction image correction process is described asbeing based on a single reference picture, but the same applies when aprediction image is corrected based on a plurality of referencepictures. In such a case, after corrected prediction images resultingfrom performing correction based on each of the reference pictures areobtained, the obtained corrected prediction images are furthersuperimposed to obtain the final prediction image.

Note that the unit of the current block may be a prediction block and,alternatively, may be a sub-block obtained by further dividing theprediction block.

One example of a method for determining whether to implement OBMCprocessing is by using an obmc_flag, which is a signal that indicateswhether to implement OBMC processing. As one specific example, theencoder determines whether the current block belongs to a regionincluding complicated motion. The encoder sets the obmc_flag to a valueof “1” when the block belongs to a region including complicated motionand implements OBMC processing when encoding, and sets the obmc_flag toa value of “0” when the block does not belong to a region includingcomplication motion and encodes without implementing OBMC processing.The decoder switches between implementing OBMC processing or not bydecoding the obmc_flag written in the stream and performing the decodingin accordance with the flag value.

Note that the motion information may be derived on the decoder sidewithout being signalled. For example, a merge mode defined in theH.265/HEVC standard may be used. Moreover, for example, the motioninformation may be derived by performing motion estimation on thedecoder side. In this case, motion estimation is performed without usingthe pixel values of the current block.

Here, a mode for performing motion estimation on the decoder side willbe described. A mode for performing motion estimation on the decoderside is also referred to as pattern matched motion vector derivation(PMMVD) mode or frame rate up-conversion (FRUC) mode.

One example of FRUC processing is illustrated in FIG. 5D. First, acandidate list (a candidate list may be a merge list) of candidates eachincluding a motion vector predictor is generated with reference tomotion vectors of encoded blocks that spatially or temporally neighborthe current block. Next, the best candidate MV is selected from among aplurality of candidate MVs registered in the candidate list. Forexample, evaluation values for the candidates included in the candidatelist are calculated and one candidate is selected based on thecalculated evaluation values.

Next, a motion vector for the current block is derived from the motionvector of the selected candidate. More specifically, for example, themotion vector for the current block is calculated as the motion vectorof the selected candidate (best candidate MV), as-is. Alternatively, themotion vector for the current block may be derived by pattern matchingperformed in the vicinity of a position in a reference picturecorresponding to the motion vector of the selected candidate. In otherwords, when the vicinity of the best candidate MV is searched via thesame method and an MV having a better evaluation value is found, thebest candidate MV may be updated to the MV having the better evaluationvalue, and the MV having the better evaluation value may be used as thefinal MV for the current block. Note that a configuration in which thisprocessing is not implemented is also acceptable.

The same processes may be performed in cases in which the processing isperformed in units of sub-blocks.

Note that an evaluation value is calculated by calculating thedifference in the reconstructed image by pattern matching performedbetween a region in a reference picture corresponding to a motion vectorand a predetermined region. Note that the evaluation value may becalculated by using some other information in addition to thedifference.

The pattern matching used is either first pattern matching or secondpattern matching. First pattern matching and second pattern matching arealso referred to as bilateral matching and template matching,respectively.

In the first pattern matching, pattern matching is performed between twoblocks along the motion trajectory of the current block in two differentreference pictures. Therefore, in the first pattern matching, a regionin another reference picture conforming to the motion trajectory of thecurrent block is used as the predetermined region for theabove-described calculation of the candidate evaluation value.

FIG. 6 is for illustrating one example of pattern matching (bilateralmatching) between two blocks along a motion trajectory. As illustratedin FIG. 6 , in the first pattern matching, two motion vectors (MV0, MV1)are derived by finding the best match between two blocks along themotion trajectory of the current block (Cur block) in two differentreference pictures (Ref0, Ref1). More specifically, a difference between(i) a reconstructed image in a specified position in a first encodedreference picture (Ref0) specified by a candidate MV and (ii) areconstructed picture in a specified position in a second encodedreference picture (Ref1) specified by a symmetrical MV scaled at adisplay time interval of the candidate MV may be derived, and theevaluation value for the current block may be calculated by using thederived difference. The candidate MV having the best evaluation valueamong the plurality of candidate MVs may be selected as the final MV.

Under the assumption of continuous motion trajectory, the motion vectors(MV0, MV1) pointing to the two reference blocks shall be proportional tothe temporal distances (TD0, TD1) between the current picture (Cur Pic)and the two reference pictures (Ref0, Ref1). For example, when thecurrent picture is temporally between the two reference pictures and thetemporal distance from the current picture to the two reference picturesis the same, the first pattern matching derives a mirror basedbi-directional motion vector.

In the second pattern matching, pattern matching is performed between atemplate in the current picture (blocks neighboring the current block inthe current picture (for example, the top and/or left neighboringblocks)) and a block in a reference picture. Therefore, in the secondpattern matching, a block neighboring the current block in the currentpicture is used as the predetermined region for the above-describedcalculation of the candidate evaluation value.

FIG. 7 is for illustrating one example of pattern matching (templatematching) between a template in the current picture and a block in areference picture. As illustrated in FIG. 7 , in the second patternmatching, a motion vector of the current block is derived by searching areference picture (Ref0) to find the block that best matches neighboringblocks of the current block (Cur block) in the current picture (CurPic). More specifically, a difference between (i) a reconstructed imageof an encoded region that is both or one of the neighboring left andneighboring upper regions and (ii) a reconstructed picture in the sameposition in an encoded reference picture (Ref0) specified by a candidateMV may be derived, and the evaluation value for the current block may becalculated by using the derived difference. The candidate MV having thebest evaluation value among the plurality of candidate MVs may beselected as the best candidate MV.

Information indicating whether to apply the FRUC mode or not (referredto as, for example, a FRUC flag) is signalled at the CU level. Moreover,when the FRUC mode is applied (for example, when the FRUC flag is set totrue), information indicating the pattern matching method (first patternmatching or second pattern matching) is signalled at the CU level. Notethat the signaling of such information need not be performed at the CUlevel, and may be performed at another level (for example, at thesequence level, picture level, slice level, tile level, CTU level, orsub-block level).

Here, a mode for deriving a motion vector based on a model assuminguniform linear motion will be described. This mode is also referred toas a bi-directional optical flow (BIO) mode.

FIG. 8 is for illustrating a model assuming uniform linear motion. InFIG. 8 , (v_(x), v_(y)) denotes a velocity vector, and τ₀ and τ₁ denotetemporal distances between the current picture (Cur Pic) and tworeference pictures (Ref₀, Ref₁). (MVx₀, MVy₀) denotes a motion vectorcorresponding to reference picture Ref₀, and (MVx₁, MVy₁) denotes amotion vector corresponding to reference picture Ref₁.

Here, under the assumption of uniform linear motion exhibited byvelocity vector (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) arerepresented as (v_(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁),respectively, and the following optical flow equation is given.MATH. 1∂I ^((k)) /∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0.  (1)

Here, I^((k)) denotes a luma value from reference picture k (k=0, 1)after motion compensation. This optical flow equation shows that the sumof (i) the time derivative of the luma value, (ii) the product of thehorizontal velocity and the horizontal component of the spatial gradientof a reference picture, and (iii) the product of the vertical velocityand the vertical component of the spatial gradient of a referencepicture is equal to zero. A motion vector of each block obtained from,for example, a merge list is corrected pixel by pixel based on acombination of the optical flow equation and Hermite interpolation.

Note that a motion vector may be derived on the decoder side using amethod other than deriving a motion vector based on a model assuminguniform linear motion. For example, a motion vector may be derived foreach sub-block based on motion vectors of neighboring blocks.

Here, a mode in which a motion vector is derived for each sub-blockbased on motion vectors of neighboring blocks will be described. Thismode is also referred to as affine motion compensation prediction mode.

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks. In FIG. 9A, the currentblock includes 16 4×4 sub-blocks. Here, motion vector v₀ of the top leftcorner control point in the current block is derived based on motionvectors of neighboring sub-blocks, and motion vector v₁ of the top rightcorner control point in the current block is derived based on motionvectors of neighboring blocks. Then, using the two motion vectors v₀ andv₁, the motion vector (v_(x), v_(y)) of each sub-block in the currentblock is derived using Equation 2 below.

MATH.2 $\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}}\end{matrix} \right. & (2)\end{matrix}$

Here, x and y are the horizontal and vertical positions of thesub-block, respectively, and w is a predetermined weighted coefficient.

Such an affine motion compensation prediction mode may include a numberof modes of different methods of deriving the motion vectors of the topleft and top right corner control points. Information indicating such anaffine motion compensation prediction mode (referred to as, for example,an affine flag) is signalled at the CU level. Note that the signaling ofinformation indicating the affine motion compensation prediction modeneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, CTU level, or sub-block level).

[Prediction Controller]

Prediction controller 128 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto subtractor 104 and adder 116.

Here, an example of deriving a motion vector via merge mode in a currentpicture will be given. FIG. 9B is for illustrating an outline of aprocess for deriving a motion vector via merge mode.

First, an MV predictor list in which candidate MV predictors areregistered is generated. Examples of candidate MV predictors include:spatially neighboring MV predictors, which are MVs of encoded blockspositioned in the spatial vicinity of the current block; a temporallyneighboring MV predictor, which is an MV of a block in an encodedreference picture that neighbors a block in the same location as thecurrent block; a combined MV predictor, which is an MV generated bycombining the MV values of the spatially neighboring MV predictor andthe temporally neighboring MV predictor; and a zero MV predictor, whichis an MV whose value is zero.

Next, the MV of the current block is determined by selecting one MVpredictor from among the plurality of MV predictors registered in the MVpredictor list.

Furthermore, in the variable-length encoder, a merge_idx, which is asignal indicating which MV predictor is selected, is written and encodedinto the stream.

Note that the MV predictors registered in the MV predictor listillustrated in FIG. 9B constitute one example. The number of MVpredictors registered in the MV predictor list may be different from thenumber illustrated in FIG. 9B, the MV predictors registered in the MVpredictor list may omit one or more of the types of MV predictors givenin the example in FIG. 9B, and the MV predictors registered in the MVpredictor list may include one or more types of MV predictors inaddition to and different from the types given in the example in FIG.9B.

Note that the final MV may be determined by performing DMVR processing(to be described later) by using the MV of the current block derived viamerge mode.

Here, an example of determining an MV by using DMVR processing will begiven.

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing.

First, the most appropriate MVP set for the current block is consideredto be the candidate MV, reference pixels are obtained from a firstreference picture, which is a picture processed in the L0 direction inaccordance with the candidate MV, and a second reference picture, whichis a picture processed in the L1 direction in accordance with thecandidate MV, and a template is generated by calculating the average ofthe reference pixels.

Next, using the template, the surrounding regions of the candidate MVsof the first and second reference pictures are searched, and the MV withthe lowest cost is determined to be the final MV. Note that the costvalue is calculated using, for example, the difference between eachpixel value in the template and each pixel value in the regionssearched, as well as the MV value.

Note that the outlines of the processes described here are fundamentallythe same in both the encoder and the decoder.

Note that processing other than the processing exactly as describedabove may be used, so long as the processing is capable of deriving thefinal MV by searching the surroundings of the candidate MV.

Here, an example of a mode that generates a prediction image by usingLIC processing will be given.

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing.

First, an MV is extracted for obtaining, from an encoded referencepicture, a reference image corresponding to the current block.

Next, information indicating how the luminance value changed between thereference picture and the current picture is extracted and a luminancecorrection parameter is calculated by using the luminance pixel valuesfor the encoded left neighboring reference region and the encoded upperneighboring reference region, and the luminance pixel value in the samelocation in the reference picture specified by the MV.

The prediction image for the current block is generated by performing aluminance correction process by using the luminance correction parameteron the reference image in the reference picture specified by the MV.

Note that the shape of the surrounding reference region illustrated inFIG. 9D is just one example; the surrounding reference region may have adifferent shape.

Moreover, although a prediction image is generated from a singlereference picture in this example, in cases in which a prediction imageis generated from a plurality of reference pictures as well, theprediction image is generated after performing a luminance correctionprocess, via the same method, on the reference images obtained from thereference pictures.

One example of a method for determining whether to implement LICprocessing is by using an lic_flag, which is a signal that indicateswhether to implement LIC processing. As one specific example, theencoder determines whether the current block belongs to a region ofluminance change. The encoder sets the lic_flag to a value of “1” whenthe block belongs to a region of luminance change and implements LICprocessing when encoding, and sets the lic_flag to a value of “0” whenthe block does not belong to a region of luminance change and encodeswithout implementing LIC processing. The decoder switches betweenimplementing LIC processing or not by decoding the lic_flag written inthe stream and performing the decoding in accordance with the flagvalue.

One example of a different method of determining whether to implementLIC processing is determining so in accordance with whether LICprocessing was determined to be implemented for a surrounding block. Inone specific example, when merge mode is used on the current block,whether LIC processing was applied in the encoding of the surroundingencoded block selected upon deriving the MV in the merge mode processingmay be determined, and whether to implement LIC processing or not can beswitched based on the result of the determination. Note that in thisexample, the same applies to the processing performed on the decoderside.

[Decoder Outline]

Next, a decoder capable of decoding an encoded signal (encodedbitstream) output from encoder 100 will be described. FIG. 10 is a blockdiagram illustrating a functional configuration of decoder 200 accordingto Embodiment 1. Decoder 200 is a moving picture/picture decoder thatdecodes a moving picture/picture block by block.

As illustrated in FIG. 10 , decoder 200 includes entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, block memory210, loop filter 212, frame memory 214, intra predictor 216, interpredictor 218, and prediction controller 220.

Decoder 200 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, loop filter212, intra predictor 216, inter predictor 218, and prediction controller220. Alternatively, decoder 200 may be realized as one or more dedicatedelectronic circuits corresponding to entropy decoder 202, inversequantizer 204, inverse transformer 206, adder 208, loop filter 212,intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, each component included in decoder 200 will be described.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. Morespecifically, for example, entropy decoder 202 arithmetic decodes anencoded bitstream into a binary signal. Entropy decoder 202 thendebinarizes the binary signal. With this, entropy decoder 202 outputsquantized coefficients of each block to inverse quantizer 204.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of ablock to be decoded (hereinafter referred to as a current block), whichare inputs from entropy decoder 202. More specifically, inversequantizer 204 inverse quantizes quantized coefficients of the currentblock based on quantization parameters corresponding to the quantizedcoefficients. Inverse quantizer 204 then outputs the inverse quantizedcoefficients (i.e., transform coefficients) of the current block toinverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 204.

For example, when information parsed from an encoded bitstream indicatesapplication of EMT or AMT (for example, when the AMT flag is set totrue), inverse transformer 206 inverse transforms the transformcoefficients of the current block based on information indicating theparsed transform type.

Moreover, for example, when information parsed from an encoded bitstreamindicates application of NSST, inverse transformer 206 applies asecondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 206, and prediction samples,which is an input from prediction controller 220. Adder 208 then outputsthe reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to bedecoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 210 storesreconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder208, and outputs the filtered reconstructed blocks to frame memory 214and, for example, a display device.

When information indicating the enabling or disabling of ALF parsed froman encoded bitstream indicates enabled, one filter from among aplurality of filters is selected based on direction and activity oflocal gradients, and the selected filter is applied to the reconstructedblock.

[Frame Memory]

Frame memory 214 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 214 stores reconstructed blocks filtered byloop filter 212.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra predictionsignal) by intra prediction with reference to a block or blocks in thecurrent picture and stored in block memory 210, based on the intraprediction mode parsed from the encoded bitstream. More specifically,intra predictor 216 generates an intra prediction signal by intraprediction with reference to samples (for example, luma and/or chromavalues) of a block or blocks neighboring the current block, and thenoutputs the intra prediction signal to prediction controller 220.

Note that when an intra prediction mode in which a chroma block is intrapredicted from a luma block is selected, intra predictor 216 may predictthe chroma component of the current block based on the luma component ofthe current block.

Moreover, when information indicating the application of PDPC is parsedfrom an encoded bitstream, intra predictor 216 correctspost-intra-prediction pixel values based on horizontal/verticalreference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block with reference to areference picture stored in frame memory 214. Inter prediction isperformed per current block or per sub-block (for example, per 4×4block) in the current block. For example, inter predictor 218 generatesan inter prediction signal of the current block or sub-block by motioncompensation by using motion information (for example, a motion vector)parsed from an encoded bitstream, and outputs the inter predictionsignal to prediction controller 220.

Note that when the information parsed from the encoded bitstreamindicates application of OBMC mode, inter predictor 218 generates theinter prediction signal using motion information for a neighboring blockin addition to motion information for the current block obtained frommotion estimation.

Moreover, when the information parsed from the encoded bitstreamindicates application of FRUC mode, inter predictor 218 derives motioninformation by performing motion estimation in accordance with thepattern matching method (bilateral matching or template matching) parsedfrom the encoded bitstream. Inter predictor 218 then performs motioncompensation using the derived motion information.

Moreover, when BIO mode is to be applied, inter predictor 218 derives amotion vector based on a model assuming uniform linear motion. Moreover,when the information parsed from the encoded bitstream indicates thataffine motion compensation prediction mode is to be applied, interpredictor 218 derives a motion vector of each sub-block based on motionvectors of neighboring blocks.

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto adder 208.

[Deblocking Filtering]

Next, deblocking filtering performed by encoder 100 or decoder 200configured as described above will be described in detail with referenceto the drawings. Hereinafter, the operation performed by loop filter 120included in encoder 100 will be mainly described, but the operationperformed by loop filter 212 included in decoder 200 is the same as thatperformed by loop filter 120.

As described above, when encoding an image, encoder 100 calculatesprediction errors by subtracting, from an original signal, a predictionsignal generated by intra predictor 124 or inter predictor 126. Encoder100 generates quantized coefficients by performing orthogonal transformand quantization on the prediction errors. Furthermore, encoder 100reconstructs the prediction errors by performing inverse quantizationand inverse orthogonal transform on the quantized coefficients obtained.Here, since the quantization is an irreversible process, thereconstructed prediction errors have errors (quantization errors) withrespect to prediction errors that are before being transformed.

The deblocking filtering performed by loop filter 120 is a kind offiltering performed with the aim to reduce such quantization errors. Thedeblocking filtering is applied to a block boundary for removing blocknoises.

FIG. 11 is a flowchart illustrating an outline of deblocking filteringaccording to the present embodiment. First, loop filter 120 determineswhether to perform deblocking filtering on a current boundary which is acurrent block boundary to be processed, by using the pixel values ofpixels in a block or quantization parameters, for example (S101). Whendetermining to perform deblocking filtering (Yes at S101), loop filter120 determines a filter characteristic (S102) and performs deblockingfiltering on the current boundary using the filter characteristicdetermined (S103).

For example, in the determination of filter characteristic, loop filter120 selects a filter to be used from among several types of filtercandidates each of which has a different number of pixels to be used forfiltering. The filter candidates are, for example, a weak filter whichuses a small number of pixels for filtering, a strong filter which usesmore pixels for filtering than the weak filter, and a super-strongfilter which uses even more pixels for filtering than the strong filter.

FIG. 12 illustrates an example of each of such filter candidates. Asillustrated in FIG. 12 , the number of pixels used for each filter is,for example, as follows: a weak filter may use three pixels located ateach of the upper and lower sides of a boundary; a strong filter may usefour pixels located at each of the upper and lower sides of theboundary; and a super-strong filter may use eight pixels located at eachof the upper and lower sides of the boundary. Note that an example of ablock boundary between vertically neighboring blocks is illustratedhere, but the same applies to a block boundary between horizontallyneighboring blocks.

The filter candidates may include a plurality of filters having the samenumber of pixels to be used for filtering, but different filtercharacteristics due to different filter coefficients. Note also that thenumber of pixels to be used for filtering may not be the same as thenumber of current pixels to be filtered. With the use of the strongfilter, for example, displacement is calculated using four pixelslocated at each of the upper and lower sides of the boundary, but loopfilter 120 may perform filtering on three pixels located at each of theupper and lower sides of the boundary. In other words, the number ofpixels to be used for filtering may be greater than the number ofcurrent pixels to be filtered.

[First Aspect of Filter Candidates Determination Process]

In the determination of filter characteristic (S102) as described above,loop filter 120 determines a plurality of filter candidates and selectsa filter to be used for deblocking filtering from among the plurality offilter candidates determined. Hereinafter, the first aspect of a processto determine a filter candidate will be described. FIG. 13 is aflowchart illustrating the first aspect of the filter candidatesdetermination process included in the deblocking filtering performed byencoder 100 according to the present embodiment.

First, loop filter 120 obtains the location of a current boundary whichis a current block boundary to be filtered (S111). Hereinafter, out oftwo blocks neighboring the current boundary, a block located at thelower or right side of the current boundary is referred to as “currentblock” and a block located at the upper or left side of the currentboundary is referred to as “neighboring block”.

Subsequently, loop filter 120 determines whether the location of thecurrent boundary is a predetermined location (S112). The predeterminedlocation here may be, for example, the upper edge of or either the upperor left edge of a CTU to which a current block belongs, or the upperedge of or either the upper or left edge of a CU to which a currentblock belongs. In other words, the predetermined location may be theupper edge of or either the upper or left edge of a unit block (CTU orCU) which includes a plurality of blocks and to which a current blockbelongs.

When the location of the current boundary is the predetermined location(Yes in S112), loop filter 120 adds an asymmetric filter to the filtercandidates (S113). Specifically, loop filter 120 adds the asymmetricfilter to the filter candidates initially determined, to replace afilter candidate that uses for filtering the largest number of pixelsamong the filter candidates. The asymmetric filter here is a filterwhich uses, for filtering, pixels located at one side of a boundary andpixels located at the other side of the boundary, of which the numbersare asymmetric. Stated differently, the asymmetric filter is a filterwhich uses, for filtering, pixels in a current block and pixels in aneighboring block, and the number of the pixels in the current block isdifferent from the number of the pixels in the neighboring block.Specifically, the asymmetric filter is a filter having filtertap-lengths with one filter tap-length on one side of a current boundarybeing different from the other filter tap-length on the other side ofthe current boundary.

When the initial filter candidates include, for example, the following:the weak filter that uses three pixels located at each of the upper andlower sides of the boundary; the strong filter that uses four pixelslocated at each of the upper and lower sides of the boundary; and thesuper-strong filter that uses eight pixels located at each of the upperand lower sides of the boundary, as illustrated in FIG. 12 , loop filter120 replaces the super-strong filter with the asymmetric filter. Namely,loop filter 120 determines a filter to be used from among a plurality ofcandidates, and when determining to use the super-strong filter, loopfilter 120 may determine whether to replace the super-strong filter withthe asymmetric filter.

FIG. 14 illustrates an example of each of the filter candidates afterthe replacement has been made. The super-strong filter is replaced, forexample, with a filter that uses four pixels on one side of the boundaryand twelve pixels on the other side of the boundary, of which thenumbers are asymmetric, as illustrated in FIG. 14 . Such an asymmetricfilter uses, for example, pixels located at the side of a neighboringblock which are smaller in number than pixels located at the side of acurrent block.

The number of pixels that are located at the neighboring block side andare used by the super-strong filter illustrated in FIG. 14 is smallerthan the number of pixels that are located at the neighboring block sideand are used by the super-strong filter illustrated in FIG. 12 . Thenumber of pixels that are located at the current block side and are usedby the super-strong filter illustrated in FIG. 14 is larger than thenumber of pixels that are located at the current block side and are usedby the super-strong filter illustrated in FIG. 12 . The total number ofthe pixels located at the neighboring block side and the pixels locatedat the current block side, which are used by the super-strong filterillustrated in FIG. 14 , equals to the total number of the pixelslocated at the neighboring block side and the pixels located at thecurrent block side, which are used by the super-strong filterillustrated in FIG. 12 .

The number of pixels that are located at the current block side and areused by the asymmetric filter may be the same as the number of pixelsthat are located at the current block side and are used by the filterthat is included in the filter candidates before being replaced with theasymmetric filter. The total number of pixels used by the asymmetricfilter may be different from the total number of pixels used by thefilter that is included in the filter candidates before the replacementis made.

On the contrary, when the location of the current boundary is not thepredetermined location (NO at S112), loop filter 120 does not add theasymmetric filter to the filter candidates, and selects a filter to beused from among the initial filter candidates, for instance. Loop filter120 selects a filter to be used, for example, from among a plurality offilter candidates excluding the asymmetric filter illustrated in FIG. 12.

[Advantageous Effects of First Aspect]

As described above, the configuration according to the first aspectmakes it possible to reduce the amount of data stored in a line memory.Specifically, with the use of an asymmetric filter, it is possible tochange the number of pixels to be used for filtering and also change thenumber of pixels to be stored in a memory. Accordingly, memory capacitynecessary for storing the pixel values of a block can be reduced.

[Second Aspect of Filter Candidates Determination Process]

Hereinafter, the second aspect of a process to determine filtercandidates will be described. In the first aspect, an example of using,as an asymmetric filter, a filter having filter tap-lengths with onefilter tap-length on a current block side being different from the otherfilter tap-length on a neighboring block side has been illustrated. Inthe present aspect, a filter for filtering including extrapolation isused as an asymmetric filter.

FIG. 15 is a flowchart illustrating the second aspect of the filtercandidates determination process included in the deblocking filteringperformed by encoder 100 according to the present embodiment.

First, loop filter 120 obtains the location of a current boundary whichis a current block boundary to be filtered (S121). Subsequently, loopfilter 120 determines whether the location of the current boundary is apredetermined location (S122). The predetermined location here may be,for example, the upper edge of or either the upper or left edge of a CTUto which a current block belongs, or the upper edge of or either theupper or left edge of a CU to which a current block belongs. In otherwords, the predetermined location may be the upper edge of or eitherupper or left edge of a unit block (CTU or CU) which includes aplurality of blocks and to which a current block belongs.

When the location of the current boundary is the predetermined location(Yes in S122), loop filter 120 generates the pixel values ofpredetermined pixels through extrapolation, and adds, to filtercandidates, a filter for filtering including extrapolation that is aprocess of performing filtering using the generated pixel values (S123).Specifically, loop filter 120 adds the filter for filtering includingextrapolation to a plurality of filter candidates, to replace a filtercandidate that uses, for filtering, the largest number of pixels amongthe plurality of filter candidates. The predetermined pixels are pixelswhich are included in a neighboring block and are located in thevicinity of a current boundary.

When the initial filter candidates include, for example, the following:the weak filter that uses three pixels located at each of the upper andlower sides of the boundary; the strong filter that uses four pixelslocated at each of the upper and lower sides of the boundary; and thesuper-strong filter that uses eight pixels located at each of the upperand lower sides of the boundary, as illustrated in FIG. 12 , loop filter120 replaces the super-strong filter with the filter for filteringincluding extrapolation.

FIG. 16 illustrates an example of each of the filter candidates afterthe replacement is made. For the filter for filtering includingextrapolation, for example, loop filter 120 generates the pixel valuesof four pixels located above four pixels located at the upper side of acurrent boundary, using the four pixels located at the upper side of thecurrent boundary, as illustrated in FIG. 16 . Subsequently, loop filter120 performs filtering using the pixel values of the four pixels locatedat the upper side of the current boundary, the pixel values of the fourpixels generated through the extrapolation, and the pixel values ofeight pixels located at the lower side of the current boundary.

The extrapolation here is, for example, a padding or mirroring process.In the padding process, the pixel values of current pixels to beextrapolated are generated, for example, by copying the pixel values ofpixels neighboring the current pixels. In the example illustrated inFIG. 16 , for example, the pixel values of four pixels located at theupper side of the current boundary are copied. In the mirroring process,pixel values to be extrapolated are generated by inverting pixel valuesto be used for extrapolation at the boundary between the pixel values tobe used for extrapolation and the pixel values to be extrapolated, andplacing the inverted values. In the example illustrated in FIG. 16 , forexample, the pixel values of four current pixels to be extrapolated aregenerated by vertically inverting the pixel values of four pixelslocated at the upper side of the current boundary. The process ofcompensating for the lack of pixels in order to make pixels on one sideof a boundary and pixels on the other side of the boundary, which are tobe used for filtering, symmetric in number is referred to asextrapolation, but may be also referred to as interpolation or a pixelgeneration process.

The number of pixels located at a neighboring block side and used by asuper-strong filter illustrated in FIG. 16 is smaller than the number ofpixels located at the neighboring block side and used by thesuper-strong filter illustrated in FIG. 12 . The number of pixelslocated at a current block side and used by the super-strong filterillustrated in FIG. 16 is greater than the number of pixels located atthe current block side and used by the super-strong filter illustratedin FIG. 12 . A current pixel to be extrapolated is at least one pixelneighboring, on the side (upper or left side) opposite to the side wherethe current boundary is located, a pixel that is located at theneighboring block side and is used for extrapolation.

A filter that uses the pixel values generated through extrapolation maybe the same as the filter that is included in the filter candidatesbefore the replacement is made. In other words, the filter that uses thepixel values generated through extrapolation may be a filter that usesthe pixel values of pixels located at one side of a block boundary andof pixels located at the other side of the block boundary, where thenumber of the pixels located at one side is the same as the number ofthe pixels located at the other side. For example, the super-strongfilter illustrated in FIG. 12 , which uses eight pixels located at eachof the upper and lower sides of the boundary, may be used in thisexample.

On the contrary, when the location of the current boundary is not thepredetermined location (NO at S122), loop filter 120 does not add thefilter for filtering including extrapolation to the filter candidates,and selects a filter to be used from among the initial filtercandidates, for instance. Loop filter 120 selects a filter to be used,for example, from among a plurality of filter candidates excluding theasymmetric filter illustrated in FIG. 12 .

[Advantageous Effects of Second Aspect]

As described above, the configuration of the second aspect makes itpossible to reduce the amount of data stored in a line memory.Specifically, it is possible to change the number of pixels to be usedfor filtering, using a filter for filtering including extrapolation.Accordingly, memory capacity necessary for storing the pixel values of ablock can be reduced.

Compared with the first aspect, since there is no need to change afilter itself, processing may be simplified.

Variations

For the asymmetric filter described in the first or second aspect, thenumber of pixels to be used on a neighboring block side (the upper orleft side) of a block boundary is smaller than the number of pixels tobe used on a current block side (the lower or right side) of the blockboundary. The number of pixels, required by the asymmetric filter, whichare located at the neighboring block side of the block boundary may be,for example, at most the number of pixels that are located at theneighboring block side of the block boundary and are used by a filtercandidate (e.g., the strong filter illustrated in FIG. 12 , FIG. 14 , orFIG. 16 ) that uses the second smallest number of pixels after a filtercandidate to be replaced (e.g., the super-strong filter illustrated inFIG. 12 ) and that is included in the initial filter candidates. In theexample illustrated in FIG. 12 , FIG. 14 , or FIG. 16 , since the strongfilter uses four pixels located at each of the upper and lower sides ofthe boundary, the asymmetric filter uses four pixels located at the leftor upper side of the block boundary which is the same as the number ofpixels used by the strong filter.

The number of pixels, required by an asymmetric filter, which arelocated at the neighboring block side of a block boundary may be at mostthe number of pixels that are located at the neighboring block side andare used in a process using the largest number of pixels located at theneighboring block side among all of processes which are included indeblocking filtering including loop filtering and from which a processusing a filter candidate that is before being replaced (e.g., thesuper-strong filter illustrated in FIG. 12 ) is excluded. When pixelsare required up to six pixels away from a current pixel to be filteredin ALF processing, for example, the number of pixels used by anasymmetric filter at the neighboring block side of a block boundary maybe at most six.

The above-described processing may be controlled on or off according toluma and chroma. The processing may be, for example, applied to one ofluma and chroma, and does not need to be applied to the other of lumaand chroma. Behavior may be switched according to luma and chroma.

Information indicating whether to perform the processing may be writteninto syntax. In other words, an encoder may generate a bitstreamincluding the information. A decoder may decode the information from thebitstream, and switch whether to perform the processing, according tothe decoded information.

In the above description, when the location of a current boundary is apredetermined location, whether to use an asymmetric filter isdetermined, but the determination may be made using a method other thanthis. For example, loop filter 120 may calculate, based on apredetermined reference, an evaluation value for both an image obtainedby using an asymmetric filter and an image obtained without using anasymmetric filter, and select a method that has scored the highestevaluation value. For the evaluation, rate distortion (RD) optimizationmay be used, for instance.

The expression “the number of pixels to be used for filtering” in thepresent embodiment may mean all of pixels to be used for filtering orpixels located at one side of a current boundary to be filtered amongthe pixels to be used for filtering.

When the pixels to be used for filtering satisfy a predeterminedcondition, loop filter 120 may replace, with a different filtercandidate, at least one filter candidate among filter candidatesprescribed in advance or add a different filter candidate to the filtercandidates prescribed in advance. Namely, in the present embodiment,loop filter 120 may set, as a candidate, a predetermined filter insteadof a super-strong filter, or add, to the filter candidates, apredetermined filter in addition to a super-strong filter.

The pixels to be used for filtering may be, for example, pixels to beused for making a determination on filter application, pixels to be usedfor the determination of filter characteristic, or pixels to whichfiltering is applied.

The above has mainly focused on the operation of loop filter 120included in encoder 100, but the same operation is performed by loopfilter 212 included in decoder 200.

All of the processes described in the present embodiment are not alwaysnecessary, and only part of the processes may be performed.

[Conclusion]

As described above, encoder 100 according to the present embodimentdetermines a filter to be used for deblocking filtering from among aplurality of filters including a first filter and a second filter(S102), and performs the deblocking filtering on a block boundary usingthe filter determined. The first filter uses M pixels located at theupper side of a block boundary and M pixels located at the lower side ofthe block boundary, where M denotes an integer of at least 2. The secondfilter uses first pixels located at the upper side of the block boundaryand second pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of second pixels is any one of a plurality ofsecond candidate values. The plurality of first candidate values and theplurality of second candidate values are each a value that is greaterthan or equal to M.

According to this, encoder 100 is capable of reducing the number ofpixels located at the upper or left side of the block boundary which areto be used for deblocking filtering. Encoder 100 may therefore becapable of reducing the amount of data stored in a memory.

For example, cases for the second filter are as follows: a case wherethe number of the first pixels is same as the number of the secondpixels; and a case where the number of the first pixels is differentfrom the number of the second pixels.

For example, the plurality of first candidate values and the pluralityof second candidate values are each a value greater than or equal to 4.

For example, among the plurality of filters, a filter other than thesecond filter uses a same number of pixels located at the upper side ofthe block boundary and pixels located at the lower side of the blockboundary.

For example, encoder 100 determines the largest possible value for thenumber of the first pixels, for example, according to whether thelocation of the block boundary is a predetermined location.

For example, the predetermined location is the upper edge of a codingtree unit (CTU). For example, the predetermined location is the upper orleft edge of a coding tree unit (CTU). For example, the predeterminedlocation is the upper edge of a coding unit (CU). For example, thepredetermined location is the upper or left edge of a coding unit (CU).

The largest possible value for the number of the first pixels is, forexample, at most the number of pixels that are located at the upper sideof the block boundary and are used by a filter (e.g., the strong filterillustrated in FIG. 12 ) using the second largest number of pixels afterthe second filter (e.g., the super-strong filter illustrated in FIG. 12) among the plurality of filters.

The largest possible value for the number of the first pixel values is,for example, at most the number of pixels that are located at the upperside of the block boundary and are used in a process using the largestnumber of pixels located at the upper side among processes which areincluded in loop filtering including deblocking filtering and from whicha process using the second filter (e.g., the super-strong filterillustrated in FIG. 12 ) is excluded.

As stated in the first aspect, in the case where the number of the firstpixels is different from the number of the second pixels, for example, afilter tap-length on one side of the block boundary is different from afilter tap-length on the other side of the block boundary.

As stated in the second aspect, in the case where the number of thefirst pixels is different from the number of the second pixels, forexample, the second filter: generates third pixels that are sequentiallylocated above the first pixels, using the first pixels; and uses thefirst pixels, the second pixels, and the third pixels. A sum of thenumber of the first pixels and the number of the third pixels equals tothe number of the second pixels.

Decoder 200 according to the present embodiment determines a filter tobe used for deblocking filtering from among a plurality of filtersincluding a first filter and a second filter (S102), and performsdeblocking filtering on a block boundary using the filter determined(S103). The first filter uses M pixels located at the upper side of ablock boundary and M pixels located at the lower side of the blockboundary, where M denotes an integer of at least 2. The second filteruses first pixels located at the upper side of the block boundary andsecond pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of second pixels is any one of a plurality ofsecond candidate values. The plurality of first candidate values and theplurality of second candidate values are each a value that is greaterthan or equal to M.

According to this, decoder 200 is capable of reducing the number ofpixels located at the upper or left side of the block boundary which areto be used for deblocking filtering. The decoder may therefore becapable of reducing the amount of data stored in a memory.

For example, cases for the second filter are as follows: a case wherethe number of the first pixels is same as the number of the secondpixels; and a case where the number of the first pixels is differentfrom the number of the second pixels.

For example, the plurality of first candidate values and the pluralityof second candidate values are each a value greater than or equal to 4.

For example, among the plurality of filters, a filter other than thesecond filter uses a same number of pixels located at the upper side ofthe block boundary and pixels located at the lower side of the blockboundary.

Decoder 200 determines the largest possible value for the number of thefirst pixels, for example, according to whether the location of theblock boundary is a predetermined location.

The predetermined location is, for example, the upper edge of a codingtree unit (CTU). The predetermined location is, for example, the upperor left edge of the coding tree unit (CTU). The predetermined locationis, for example, the upper edge of a coding unit (CU). The predeterminedlocation is, for example, the upper or left edge of the coding unit(CU).

The largest possible value for the number of the first pixels is, forexample, at most the number of pixels that are located at the upper sideof the block boundary and are used by a filter (e.g., the strong filterillustrated in FIG. 12 ) using the second largest number of pixels afterthe second filter (e.g., the super-strong filter illustrated in FIG. 12) among the plurality of filters.

The largest possible value for the number of the first pixel values is,for example, at most the number of pixels that are located at the upperside of the block boundary and are used in a process using the largestnumber of pixels located at the upper side among processes which areincluded in loop filtering including deblocking filtering and from whicha process using the second filter (e.g., the super-strong filterillustrated in FIG. 12 ) is excluded.

As stated in the first aspect, in the case where the number of the firstpixels is different from the number of the second pixels, for example, afilter tap-length on one side of the block boundary is different from afilter tap-length on the other side of the block boundary.

As stated in the second aspect, in the case where the number of thefirst pixels is different from the number of the second pixels, forexample, the second filter: generates third pixels that are sequentiallylocated above the first pixels, using the first pixels; and uses thefirst pixels, the second pixels, and the third pixels. A sum of thenumber of the first pixels and the number of the third pixels equals tothe number of the second pixels.

Encoder 100 according to the present embodiment includes: splitter 102that splits an image into a plurality of blocks; intra predictor 124that predicts a block included in the image using a reference pictureincluded in the image; inter predictor 126 that predicts a blockincluded in the image using a reference block included in another imagedifferent from the image; loop filter 120 that applies a filter to theblock included in the image; transformer 106 that transforms predictionerrors between and an original signal and a prediction signal generatedby intra predictor 124 or inter predictor 126, to generate transformedcoefficients; quantizer 108 that quantizes the transformed coefficientsto generate quantized coefficients; and entropy encoder 110 thatgenerates an encoded bitstream by performing variable length coding onthe quantized coefficients. Loop filter 120 determines a filter to beused for deblocking filtering from among a plurality of filtersincluding a first filter and a second filter (S102), and performsdeblocking filtering on a block boundary using the filter determined(S103). The first filter uses M pixels located at the upper side of ablock boundary and M pixels located at the lower side of the blockboundary, where M denotes an integer of at least 2. The second filteruses first pixels located at the upper side of the block boundary andsecond pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of second pixels is any one of a plurality ofsecond candidate values. The plurality of first candidate values and theplurality of second candidate values are each a value that is greaterthan or equal to M.

Decoder 200 according to the present embodiment includes: a decodingunit (entropy decoder 202) that decodes an encoded bitstream to outputquantized coefficients; inverse quantizer 204 that inverse quantizes thequantized coefficients to output prediction errors; intra predictor 216that predicts a block included in an image using a reference pictureincluded in the image; inter predictor 218 that predicts a blockincluded in the image using a reference block included in another imagedifferent from that image; and loop filter 212 that applies a filter toa block included in the image. Loop filter 212 determines a filter to beused for deblocking filtering from among a plurality of filtersincluding a first filter and a second filter (S102), and performsdeblocking filtering on a block boundary using the filter determined(S103). The first filter uses M pixels located at the upper side of ablock boundary and M pixels located at the lower side of the blockboundary, where M denotes an integer of at least 2. The second filteruses first pixels located at the upper side of the block boundary andsecond pixels located at the lower side of the block boundary. Thenumber of the first pixels is any one of a plurality of first candidatevalues, and the number of second pixels is any one of a plurality ofsecond candidate values. The plurality of first candidate values and theplurality of second candidate values are each a value that is greaterthan or equal to M.

[Example of Implementation of Encoder]

FIG. 17 is a block diagram illustrating an example of implementation ofencoder 100 according to Embodiment 1. Encoder 100 includes circuitry160 and memory 162. For example, the elements of encoder 100 illustratedin FIG. 1 are implemented by circuitry 160 and memory 162 illustrated inFIG. 17 .

Circuitry 160 processes information and is accessible to memory 162. Forexample, circuitry 160 is a dedicated or general-purpose electroniccircuit which encodes videos. Circuitry 160 may be a processor such as acentral processing unit (CPU). Circuitry 160 may be an aggregate of aplurality of electronic circuits. For example, circuitry 160 may serveas at least two of the elements of encoder 100 illustrated in FIG. 1 ,for instance, other than the elements for storing information.

Memory 162 is a dedicated or general-purpose memory that storesinformation for circuitry 160 to encode videos. Memory 162 may be anelectronic circuit and connected to circuitry 160. Memory 162 may beincluded in circuitry 160. Memory 162 may be an aggregate of a pluralityof electronic circuits. Memory 162 may be a magnetic disk or an opticaldisc, and may be expressed as storage or recording medium. Memory 162may be nonvolatile memory or volatile memory.

For example, memory 162 may store a video to be encoded or a bit stringcorresponding to an encoded video. Memory 162 may store a program forcircuitry 160 to encode videos.

For example, memory 162 may serve as elements for storing information,among the elements of encoder 100 illustrated in FIG. 1 , for instance.Specifically, memory 162 may serve as block memory 118 and frame memory122 illustrated in FIG. 1 . More specifically, memory 162 may storereconstructed blocks and reconstructed pictures, for instance.

Note that encoder 100 may not include all the elements illustrated in,for instance, FIG. 1 , and may not perform all the processes describedabove. One or more of the elements illustrated in, for instance, FIG. 1may be included in another device, or one or more of the processesdescribed above may be performed by another device.

[Example of Implementation of Decoder]

FIG. 18 is a block diagram illustrating an example of implementation ofdecoder 200 according to Embodiment 1. Decoder 200 includes circuitry260 and memory 262. For example, the elements of decoder 200 illustratedin FIG. 10 are implemented by circuitry 260 and memory 262 illustratedin FIG. 18 .

Circuitry 260 processes information and is accessible to memory 262. Forexample, circuitry 260 is a dedicated or general-purpose electroniccircuit which decodes videos. Circuitry 260 may be a processor such as aCPU. Circuitry 260 may be an aggregate of a plurality of electroniccircuits. For example, circuitry 260 may serve as at least two of theelements of decoder 200 illustrated in, for instance, FIG. 10 , otherthan the elements for storing information.

Memory 262 is a dedicated or general-purpose memory that storesinformation for circuitry 260 to decode videos. Memory 262 may be anelectronic circuit and connected to circuitry 260. Memory 262 may beincluded in circuitry 260. Memory 262 may be an aggregate of a pluralityof electronic circuits. Memory 262 may be a magnetic disk or an opticaldisc, and may be expressed as storage or recording medium. Memory 262may be nonvolatile memory or volatile memory.

For example, memory 262 may store a bit string corresponding to anencoded video, and a video corresponding to a decoded bit string. Memory262 may store a program for circuitry 260 to decode videos.

For example, memory 262 may serve as elements for storing information,among the elements of decoder 200 illustrated in the FIG. 10 , forinstance. Specifically, memory 262 may serve as block memory 210 andframe memory 214 illustrated in FIG. 10 . More specifically, memory 262may store reconstructed blocks and reconstructed pictures, for instance.

Note that decoder 200 may not include all the elements illustrated in,for instance, FIG. 10 or may not perform all the processes describedabove. One or more of the elements illustrated in, for instance, FIG. 10may be included in another device, and one or more of the processesdescribed above may be performed by another device.

[Supplemental Information]

Encoder 100 and decoder 200 according to the present embodiment may beused as an image encoder and an image decoder, respectively, or may beused as a video encoder and a video decoder, respectively.

In the present embodiment, each of the elements may be configured ofdedicated hardware or may be implemented by executing a software programsuitable for the element. Each of the elements may be implemented by aprogram executor such as a CPU or a processor reading and executing asoftware program recorded on a recording medium such as a hard disc or asemiconductor memory.

Specifically, encoder 100 and decoder 200 may each include processingcircuitry, and storage electrically coupled to the processing circuitryand accessible from the processing circuitry. For example, theprocessing circuitry corresponds to circuitry 160 or 260, and thestorage corresponds to memory 162 or 262.

The processing circuitry includes at least one of the dedicated hardwareand the program executor, and performs processing using the storage. Ifthe processing circuitry includes a program executor, the storage storesa software program to be executed by the program executor.

Here, the software which implements encoder 100 or decoder 200 accordingto the present embodiment, for instance, is a program as follows.

The elements may be circuits as described above. These circuits mayconstitute one circuitry as a whole, or may be separate circuits. Eachelement may be implemented by a general-purpose processor or by adedicated processor.

Processing performed by a specific element may be performed by adifferent element. The order of performing processes may be changed orthe processes may be performed in parallel. An encoder/decoder mayinclude encoder 100 and decoder 200.

The above has given a description of aspects of encoder 100 and decoder200 based on the embodiments, yet the aspects of encoder 100 and decoder200 are not limited to the embodiments. The aspects of encoder 100 anddecoder 200 may also encompass various modifications that may beconceived by those skilled in the art to the embodiments, andembodiments achieved by combining elements in different embodiments,without departing from the scope of the present disclosure.

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

Embodiment 2

As described in each of the above embodiments, each functional block cantypically be realized as an MPU and memory, for example. Moreover,processes performed by each of the functional blocks are typicallyrealized by a program execution unit, such as a processor, reading andexecuting software (a program) recorded on a recording medium such asROM. The software may be distributed via, for example, downloading, andmay be recorded on a recording medium such as semiconductor memory anddistributed. Note that each functional block can, of course, also berealized as hardware (dedicated circuit).

Moreover, the processing described in each of the embodiments may berealized via integrated processing using a single apparatus (system),and, alternatively, may be realized via decentralized processing using aplurality of apparatuses. Moreover, the processor that executes theabove-described program may be a single processor or a plurality ofprocessors. In other words, integrated processing may be performed, and,alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the aboveexemplary embodiments; various modifications may be made to theexemplary embodiments, the results of which are also included within thescope of the embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (imageencoding method) and the moving picture decoding method (image decodingmethod) described in each of the above embodiments and a system thatemploys the same will be described. The system is characterized asincluding an image encoder that employs the image encoding method, animage decoder that employs the image decoding method, and an imageencoder/decoder that includes both the image encoder and the imagedecoder. Other configurations included in the system may beappropriately modified on a case-by-case basis.

Usage Examples

FIG. 19 illustrates an overall configuration of content providing systemex100 for implementing a content distribution service. The area in whichthe communication service is provided is divided into cells of desiredsizes, and base stations ex106, ex107, ex108, ex109, and ex110, whichare fixed wireless stations, are located in respective cells.

In content providing system ex100, devices including computer ex111,gaming device ex112, camera ex113, home appliance ex114, and smartphoneex115 are connected to internet ex101 via internet service providerex102 or communications network ex104 and base stations ex106 throughex110. Content providing system ex100 may combine and connect anycombination of the above elements. The devices may be directly orindirectly connected together via a telephone network or near fieldcommunication rather than via base stations ex106 through ex110, whichare fixed wireless stations. Moreover, streaming server ex103 isconnected to devices including computer ex111, gaming device ex112,camera ex113, home appliance ex114, and smartphone ex115 via, forexample, internet ex101. Streaming server ex103 is also connected to,for example, a terminal in a hotspot in airplane ex117 via satelliteex116.

Note that instead of base stations ex106 through ex110, wireless accesspoints or hotspots may be used. Streaming server ex103 may be connectedto communications network ex104 directly instead of via internet ex101or internet service provider ex102, and may be connected to airplaneex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video,such as a digital camera. Smartphone ex115 is a smartphone device,cellular phone, or personal handyphone system (PHS) phone that canoperate under the mobile communications system standards of the typical2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex118 is, for example, a refrigerator or a deviceincluded in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/orvideo capturing function is capable of, for example, live streaming byconnecting to streaming server ex103 via, for example, base stationex106. When live streaming, a terminal (e.g., computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, orairplane ex117) performs the encoding processing described in the aboveembodiments on still-image or video content captured by a user via theterminal, multiplexes video data obtained via the encoding and audiodata obtained by encoding audio corresponding to the video, andtransmits the obtained data to streaming server ex103. In other words,the terminal functions as the image encoder according to one aspect ofthe present disclosure.

Streaming server ex103 streams transmitted content data to clients thatrequest the stream. Client examples include computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, andterminals inside airplane ex117, which are capable of decoding theabove-described encoded data. Devices that receive the streamed datadecode and reproduce the received data. In other words, the devices eachfunction as the image decoder according to one aspect of the presentdisclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers orcomputers between which tasks such as the processing, recording, andstreaming of data are divided. For example, streaming server ex103 maybe realized as a content delivery network (CDN) that streams content viaa network connecting multiple edge servers located throughout the world.In a CDN, an edge server physically near the client is dynamicallyassigned to the client. Content is cached and streamed to the edgeserver to reduce load times. In the event of, for example, some kind ofan error or a change in connectivity due to, for example, a spike intraffic, it is possible to stream data stably at high speeds since it ispossible to avoid affected parts of the network by, for example,dividing the processing between a plurality of edge servers or switchingthe streaming duties to a different edge server, and continuingstreaming.

Decentralization is not limited to just the division of processing forstreaming; the encoding of the captured data may be divided between andperformed by the terminals, on the server side, or both. In one example,in typical encoding, the processing is performed in two loops. The firstloop is for detecting how complicated the image is on a frame-by-frameor scene-by-scene basis, or detecting the encoding load. The second loopis for processing that maintains image quality and improves encodingefficiency. For example, it is possible to reduce the processing load ofthe terminals and improve the quality and encoding efficiency of thecontent by having the terminals perform the first loop of the encodingand having the server side that received the content perform the secondloop of the encoding. In such a case, upon receipt of a decodingrequest, it is possible for the encoded data resulting from the firstloop performed by one terminal to be received and reproduced on anotherterminal in approximately real time. This makes it possible to realizesmooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amountfrom an image, compresses data related to the feature amount asmetadata, and transmits the compressed metadata to a server. Forexample, the server determines the significance of an object based onthe feature amount and changes the quantization accuracy accordingly toperform compression suitable for the meaning of the image. Featureamount data is particularly effective in improving the precision andefficiency of motion vector prediction during the second compressionpass performed by the server. Moreover, encoding that has a relativelylow processing load, such as variable length coding (VLC), may behandled by the terminal, and encoding that has a relatively highprocessing load, such as context-adaptive binary arithmetic coding(CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality ofvideos of approximately the same scene are captured by a plurality ofterminals in, for example, a stadium, shopping mall, or factory. In sucha case, for example, the encoding may be decentralized by dividingprocessing tasks between the plurality of terminals that captured thevideos and, if necessary, other terminals that did not capture thevideos and the server, on a per-unit basis. The units may be, forexample, groups of pictures (GOP), pictures, or tiles resulting fromdividing a picture. This makes it possible to reduce load times andachieve streaming that is closer to real-time.

Moreover, since the videos are of approximately the same scene,management and/or instruction may be carried out by the server so thatthe videos captured by the terminals can be cross-referenced. Moreover,the server may receive encoded data from the terminals, change referencerelationship between items of data or correct or replace picturesthemselves, and then perform the encoding. This makes it possible togenerate a stream with increased quality and efficiency for theindividual items of data.

Moreover, the server may stream video data after performing transcodingto convert the encoding format of the video data. For example, theserver may convert the encoding format from MPEG to VP, and may convertH.264 to H.265.

In this way, encoding can be performed by a terminal or one or moreservers. Accordingly, although the device that performs the encoding isreferred to as a “server” or “terminal” in the following description,some or all of the processes performed by the server may be performed bythe terminal, and likewise some or all of the processes performed by theterminal may be performed by the server. This also applies to decodingprocesses.

[3D, Multi-Angle]

In recent years, usage of images or videos combined from images orvideos of different scenes concurrently captured or the same scenecaptured from different angles by a plurality of terminals such ascamera ex113 and/or smartphone ex115 has increased. Videos captured bythe terminals are combined based on, for example, theseparately-obtained relative positional relationship between theterminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, theserver may encode a still image based on scene analysis of a movingpicture either automatically or at a point in time specified by theuser, and transmit the encoded still image to a reception terminal.Furthermore, when the server can obtain the relative positionalrelationship between the video capturing terminals, in addition totwo-dimensional moving pictures, the server can generatethree-dimensional geometry of a scene based on video of the same scenecaptured from different angles. Note that the server may separatelyencode three-dimensional data generated from, for example, a pointcloud, and may, based on a result of recognizing or tracking a person orobject using three-dimensional data, select or reconstruct and generatea video to be transmitted to a reception terminal from videos capturedby a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videoscorresponding to the video capturing terminals, and allows the user toenjoy the content obtained by extracting, from three-dimensional datareconstructed from a plurality of images or videos, a video from aselected viewpoint. Furthermore, similar to with video, sound may berecorded from relatively different angles, and the server may multiplex,with the video, audio from a specific angle or space in accordance withthe video, and transmit the result.

In recent years, content that is a composite of the real world and avirtual world, such as virtual reality (VR) and augmented reality (AR)content, has also become popular. In the case of VR images, the servermay create images from the viewpoints of both the left and right eyesand perform encoding that tolerates reference between the two viewpointimages, such as multi-view coding (MVC), and, alternatively, may encodethe images as separate streams without referencing. When the images aredecoded as separate streams, the streams may be synchronized whenreproduced so as to recreate a virtual three-dimensional space inaccordance with the viewpoint of the user.

In the case of AR images, the server superimposes virtual objectinformation existing in a virtual space onto camera informationrepresenting a real-world space, based on a three-dimensional positionor movement from the perspective of the user. The decoder may obtain orstore virtual object information and three-dimensional data, generatetwo-dimensional images based on movement from the perspective of theuser, and then generate superimposed data by seamlessly connecting theimages. Alternatively, the decoder may transmit, to the server, motionfrom the perspective of the user in addition to a request for virtualobject information, and the server may generate superimposed data basedon three-dimensional data stored in the server in accordance with thereceived motion, and encode and stream the generated superimposed datato the decoder. Note that superimposed data includes, in addition to RGBvalues, an α value indicating transparency, and the server sets the αvalue for sections other than the object generated fromthree-dimensional data to, for example, 0, and may perform the encodingwhile those sections are transparent. Alternatively, the server may setthe background to a predetermined RGB value, such as a chroma key, andgenerate data in which areas other than the object are set as thebackground.

Decoding of similarly streamed data may be performed by the client(i.e., the terminals), on the server side, or divided therebetween. Inone example, one terminal may transmit a reception request to a server,the requested content may be received and decoded by another terminal,and a decoded signal may be transmitted to a device having a display. Itis possible to reproduce high image quality data by decentralizingprocessing and appropriately selecting content regardless of theprocessing ability of the communications terminal itself. In yet anotherexample, while a TV, for example, is receiving image data that is largein size, a region of a picture, such as a tile obtained by dividing thepicture, may be decoded and displayed on a personal terminal orterminals of a viewer or viewers of the TV. This makes it possible forthe viewers to share a big-picture view as well as for each viewer tocheck his or her assigned area or inspect a region in further detail upclose.

In the future, both indoors and outdoors, in situations in which aplurality of wireless connections are possible over near, mid, and fardistances, it is expected to be able to seamlessly receive content evenwhen switching to data appropriate for the current connection, using astreaming system standard such as MPEG-DASH. With this, the user canswitch between data in real time while freely selecting a decoder ordisplay apparatus including not only his or her own terminal, but also,for example, displays disposed indoors or outdoors. Moreover, based on,for example, information on the position of the user, decoding can beperformed while switching which terminal handles decoding and whichterminal handles the displaying of content. This makes it possible to,while in route to a destination, display, on the wall of a nearbybuilding in which a device capable of displaying content is embedded oron part of the ground, map information while on the move. Moreover, itis also possible to switch the bit rate of the received data based onthe accessibility to the encoded data on a network, such as when encodeddata is cached on a server quickly accessible from the receptionterminal or when encoded data is copied to an edge server in a contentdelivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalablestream, illustrated in FIG. 20 , which is compression coded viaimplementation of the moving picture encoding method described in theabove embodiments. The server may have a configuration in which contentis switched while making use of the temporal and/or spatial scalabilityof a stream, which is achieved by division into and encoding of layers,as illustrated in FIG. 20 . Note that there may be a plurality ofindividual streams that are of the same content but different quality.In other words, by determining which layer to decode up to based oninternal factors, such as the processing ability on the decoder side,and external factors, such as communication bandwidth, the decoder sidecan freely switch between low resolution content and high resolutioncontent while decoding. For example, in a case in which the user wantsto continue watching, at home on a device such as a TV connected to theinternet, a video that he or she had been previously watching onsmartphone ex115 while on the move, the device can simply decode thesame stream up to a different layer, which reduces server side load.

Furthermore, in addition to the configuration described above in whichscalability is achieved as a result of the pictures being encoded perlayer and the enhancement layer is above the base layer, the enhancementlayer may include metadata based on, for example, statisticalinformation on the image, and the decoder side may generate high imagequality content by performing super-resolution imaging on a picture inthe base layer based on the metadata. Super-resolution imaging may beimproving the SN ratio while maintaining resolution and/or increasingresolution. Metadata includes information for identifying a linear or anon-linear filter coefficient used in super-resolution processing, orinformation identifying a parameter value in filter processing, machinelearning, or least squares method used in super-resolution processing.

Alternatively, a configuration in which a picture is divided into, forexample, tiles in accordance with the meaning of, for example, an objectin the image, and on the decoder side, only a partial region is decodedby selecting a tile to decode, is also acceptable. Moreover, by storingan attribute about the object (person, car, ball, etc.) and a positionof the object in the video (coordinates in identical images) asmetadata, the decoder side can identify the position of a desired objectbased on the metadata and determine which tile or tiles include thatobject. For example, as illustrated in FIG. 21 , metadata is storedusing a data storage structure different from pixel data such as an SEImessage in HEVC. This metadata indicates, for example, the position,size, or color of the main object.

Moreover, metadata may be stored in units of a plurality of pictures,such as stream, sequence, or random access units. With this, the decoderside can obtain, for example, the time at which a specific personappears in the video, and by fitting that with picture unit information,can identify a picture in which the object is present and the positionof the object in the picture.

[Web Page Optimization]

FIG. 22 illustrates an example of a display screen of a web page on, forexample, computer ex111. FIG. 23 illustrates an example of a displayscreen of a web page on, for example, smartphone ex115. As illustratedin FIG. 22 and FIG. 23 , a web page may include a plurality of imagelinks which are links to image content, and the appearance of the webpage differs depending on the device used to view the web page. When aplurality of image links are viewable on the screen, until the userexplicitly selects an image link, or until the image link is in theapproximate center of the screen or the entire image link fits in thescreen, the display apparatus (decoder) displays, as the image links,still images included in the content or I pictures, displays video suchas an animated gif using a plurality of still images or I pictures, forexample, or receives only the base layer and decodes and displays thevideo.

When an image link is selected by the user, the display apparatusdecodes giving the highest priority to the base layer. Note that ifthere is information in the HTML code of the web page indicating thatthe content is scalable, the display apparatus may decode up to theenhancement layer. Moreover, in order to guarantee real timereproduction, before a selection is made or when the bandwidth isseverely limited, the display apparatus can reduce delay between thepoint in time at which the leading picture is decoded and the point intime at which the decoded picture is displayed (that is, the delaybetween the start of the decoding of the content to the displaying ofthe content) by decoding and displaying only forward reference pictures(I picture, P picture, forward reference B picture). Moreover, thedisplay apparatus may purposely ignore the reference relationshipbetween pictures and coarsely decode all B and P pictures as forwardreference pictures, and then perform normal decoding as the number ofpictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such two- orthree-dimensional map information for autonomous driving or assisteddriving of an automobile, the reception terminal may receive, inaddition to image data belonging to one or more layers, information on,for example, the weather or road construction as metadata, and associatethe metadata with the image data upon decoding. Note that metadata maybe assigned per layer and, alternatively, may simply be multiplexed withthe image data.

In such a case, since the automobile, drone, airplane, etc., includingthe reception terminal is mobile, the reception terminal can seamlesslyreceive and decode while switching between base stations among basestations ex106 through ex110 by transmitting information indicating theposition of the reception terminal upon reception request. Moreover, inaccordance with the selection made by the user, the situation of theuser, or the bandwidth of the connection, the reception terminal candynamically select to what extent the metadata is received or to whatextent the map information, for example, is updated.

With this, in content providing system ex100, the client can receive,decode, and reproduce, in real time, encoded information transmitted bythe user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality,long content distributed by a video distribution entity, unicast ormulticast streaming of low image quality, short content from anindividual is also possible. Moreover, such content from individuals islikely to further increase in popularity. The server may first performediting processing on the content before the encoding processing inorder to refine the individual content. This may be achieved with, forexample, the following configuration.

In real-time while capturing video or image content or after the contenthas been captured and accumulated, the server performs recognitionprocessing based on the raw or encoded data, such as capture errorprocessing, scene search processing, meaning analysis, and/or objectdetection processing. Then, based on the result of the recognitionprocessing, the server—either when prompted or automatically—edits thecontent, examples of which include: correction such as focus and/ormotion blur correction; removing low-priority scenes such as scenes thatare low in brightness compared to other pictures or out of focus; objectedge adjustment; and color tone adjustment. The server encodes theedited data based on the result of the editing. It is known thatexcessively long videos tend to receive fewer views. Accordingly, inorder to keep the content within a specific length that scales with thelength of the original video, the server may, in addition to thelow-priority scenes described above, automatically clip out scenes withlow movement based on an image processing result. Alternatively, theserver may generate and encode a video digest based on a result of ananalysis of the meaning of a scene.

Note that there are instances in which individual content may includecontent that infringes a copyright, moral right, portrait rights, etc.Such an instance may lead to an unfavorable situation for the creator,such as when content is shared beyond the scope intended by the creator.Accordingly, before encoding, the server may, for example, edit imagesso as to blur faces of people in the periphery of the screen or blur theinside of a house, for example. Moreover, the server may be configuredto recognize the faces of people other than a registered person inimages to be encoded, and when such faces appear in an image, forexample, apply a mosaic filter to the face of the person. Alternatively,as pre- or post-processing for encoding, the user may specify, forcopyright reasons, a region of an image including a person or a regionof the background be processed, and the server may process the specifiedregion by, for example, replacing the region with a different image orblurring the region. If the region includes a person, the person may betracked in the moving picture the head region may be replaced withanother image as the person moves.

Moreover, since there is a demand for real-time viewing of contentproduced by individuals, which tends to be small in data size, thedecoder first receives the base layer as the highest priority andperforms decoding and reproduction, although this may differ dependingon bandwidth. When the content is reproduced two or more times, such aswhen the decoder receives the enhancement layer during decoding andreproduction of the base layer and loops the reproduction, the decodermay reproduce a high image quality video including the enhancementlayer. If the stream is encoded using such scalable encoding, the videomay be low quality when in an unselected state or at the start of thevideo, but it can offer an experience in which the image quality of thestream progressively increases in an intelligent manner. This is notlimited to just scalable encoding; the same experience can be offered byconfiguring a single stream from a low quality stream reproduced for thefirst time and a second stream encoded using the first stream as areference.

Other Usage Examples

The encoding and decoding may be performed by LSI ex500, which istypically included in each terminal. LSI ex500 may be configured of asingle chip or a plurality of chips. Software for encoding and decodingmoving pictures may be integrated into some type of a recording medium(such as a CD-ROM, a flexible disk, or a hard disk) that is readable by,for example, computer ex111, and the encoding and decoding may beperformed using the software. Furthermore, when smartphone ex115 isequipped with a camera, the video data obtained by the camera may betransmitted. In this case, the video data is coded by LSI ex500 includedin smartphone ex115.

Note that LSI ex500 may be configured to download and activate anapplication. In such a case, the terminal first determines whether it iscompatible with the scheme used to encode the content or whether it iscapable of executing a specific service. When the terminal is notcompatible with the encoding scheme of the content or when the terminalis not capable of executing a specific service, the terminal firstdownloads a codec or application software then obtains and reproducesthe content.

Aside from the example of content providing system ex100 that usesinternet ex101, at least the moving picture encoder (image encoder) orthe moving picture decoder (image decoder) described in the aboveembodiments may be implemented in a digital broadcasting system. Thesame encoding processing and decoding processing may be applied totransmit and receive broadcast radio waves superimposed with multiplexedaudio and video data using, for example, a satellite, even though thisis geared toward multicast whereas unicast is easier with contentproviding system ex100.

[Hardware Configuration]

FIG. 24 illustrates smartphone ex115. FIG. 25 illustrates aconfiguration example of smartphone ex115. Smartphone ex115 includesantenna ex450 for transmitting and receiving radio waves to and frombase station ex110, camera ex465 capable of capturing video and stillimages, and display ex458 that displays decoded data, such as videocaptured by camera ex465 and video received by antenna ex450. Smartphoneex115 further includes user interface ex466 such as a touch panel, audiooutput unit ex457 such as a speaker for outputting speech or otheraudio, audio input unit ex456 such as a microphone for audio input,memory ex467 capable of storing decoded data such as captured video orstill images, recorded audio, received video or still images, and mail,as well as decoded data, and slot ex464 which is an interface for SIMex468 for authorizing access to a network and various data. Note thatexternal memory may be used instead of memory ex467.

Moreover, main controller ex460 which comprehensively controls displayex458 and user interface ex466, power supply circuit ex461, userinterface input controller ex462, video signal processor ex455, camerainterface ex463, display controller ex459, modulator/demodulator ex452,multiplexer/demultiplexer ex453, audio signal processor ex454, slotex464, and memory ex467 are connected via bus ex470.

When the user turns the power button of power supply circuit ex461 on,smartphone ex115 is powered on into an operable state by each componentbeing supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and datatransmission, based on control performed by main controller ex460, whichincludes a CPU, ROM, and RAM. When making calls, an audio signalrecorded by audio input unit ex456 is converted into a digital audiosignal by audio signal processor ex454, and this is applied with spreadspectrum processing by modulator/demodulator ex452 and digital-analogconversion and frequency conversion processing by transmitter/receiverex451, and then transmitted via antenna ex450. The received data isamplified, frequency converted, and analog-digital converted, inversespread spectrum processed by modulator/demodulator ex452, converted intoan analog audio signal by audio signal processor ex454, and then outputfrom audio output unit ex457. In data transmission mode, text,still-image, or video data is transmitted by main controller ex460 viauser interface input controller ex462 as a result of operation of, forexample, user interface ex466 of the main body, and similar transmissionand reception processing is performed. In data transmission mode, whensending a video, still image, or video and audio, video signal processorex455 compression encodes, via the moving picture encoding methoddescribed in the above embodiments, a video signal stored in memoryex467 or a video signal input from camera ex465, and transmits theencoded video data to multiplexer/demultiplexer ex453. Moreover, audiosignal processor ex454 encodes an audio signal recorded by audio inputunit ex456 while camera ex465 is capturing, for example, a video orstill image, and transmits the encoded audio data tomultiplexer/demultiplexer ex453. Multiplexer/demultiplexer ex453multiplexes the encoded video data and encoded audio data using apredetermined scheme, modulates and converts the data usingmodulator/demodulator (modulator/demodulator circuit) ex452 andtransmitter/receiver ex451, and transmits the result via antenna ex450.

When video appended in an email or a chat, or a video linked from a webpage, for example, is received, in order to decode the multiplexed datareceived via antenna ex450, multiplexer/demultiplexer ex453demultiplexes the multiplexed data to divide the multiplexed data into abitstream of video data and a bitstream of audio data, supplies theencoded video data to video signal processor ex455 via synchronous busex470, and supplies the encoded audio data to audio signal processorex454 via synchronous bus ex470. Video signal processor ex455 decodesthe video signal using a moving picture decoding method corresponding tothe moving picture encoding method described in the above embodiments,and video or a still image included in the linked moving picture file isdisplayed on display ex458 via display controller ex459. Moreover, audiosignal processor ex454 decodes the audio signal and outputs audio fromaudio output unit ex457. Note that since real-time streaming is becomingmore and more popular, there are instances in which reproduction of theaudio may be socially inappropriate depending on the user's environment.Accordingly, as an initial value, a configuration in which only videodata is reproduced, i.e., the audio signal is not reproduced, ispreferable. Audio may be synchronized and reproduced only when an input,such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, threeimplementations are conceivable: a transceiver terminal including bothan encoder and a decoder; a transmitter terminal including only anencoder; and a receiver terminal including only a decoder. Further, inthe description of the digital broadcasting system, an example is givenin which multiplexed data obtained as a result of video data beingmultiplexed with, for example, audio data, is received or transmitted,but the multiplexed data may be video data multiplexed with data otherthan audio data, such as text data related to the video. Moreover, thevideo data itself rather than multiplexed data may be received ortransmitted.

Although main controller ex460 including a CPU is described ascontrolling the encoding or decoding processes, terminals often includeGPUs. Accordingly, a configuration is acceptable in which a large areais processed at once by making use of the performance ability of the GPUvia memory shared by the CPU and GPU or memory including an address thatis managed so as to allow common usage by the CPU and GPU. This makes itpossible to shorten encoding time, maintain the real-time nature of thestream, and reduce delay. In particular, processing relating to motionestimation, deblocking filtering, sample adaptive offset (SAO), andtransformation/quantization can be effectively carried out by the GPUinstead of the CPU in units of, for example pictures, all at once.

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe process in the flowchart, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

Although only some exemplary embodiments of the present disclosure havebeen described in detail above, those skilled in the art will readilyappreciate that many modifications are possible in the exemplaryembodiments without materially departing from the novel teachings andadvantages of the present disclosure. Accordingly, all suchmodifications are intended to be included within the scope of thepresent disclosure.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, televisionreceivers, digital video recorders, car navigation systems, mobilephones, digital cameras, digital video cameras, video conferencesystems, and electron mirrors.

What is claimed is:
 1. A decoder, comprising: circuitry; and memory,wherein using the memory, the circuitry, in operation: determines anumber of first pixels and a number of second pixels used in adeblocking filter process, the first pixels located at an upper side ofa block boundary and the second pixels located at a lower side of theblock boundary, and determines whether a location of the block boundaryis a predetermined location, and performs the deblocking filter processon the block boundary; wherein, the number of the first pixels and thenumber of the second pixels are selected from among candidates, thecandidates including at least 4 and M larger than 4, the number of thesecond pixels is different from the number of the first pixels, andresponsive to the location of the block boundary being the predeterminedlocation, the number of the first pixels used in the deblocking filterprocess is limited to be
 4. 2. An encoder, comprising: circuitry; andmemory, wherein using the memory, the circuitry: determines a number offirst pixels and a number of second pixels used in a deblocking filterprocess, the first pixels located at an upper side of a block boundaryand the second pixels located at a lower side of the block boundary,determines whether a location of the block boundary is a predeterminedlocation, and performs the deblocking filter process on the blockboundary; wherein, the number of the first pixels and the number of thesecond pixels are selected from among candidates, the candidatesincluding at least 4 and M larger than 4, the number of the secondpixels is different from the number of the first pixels, and responsiveto the location of the block boundary being the predetermined location,the number of the first pixels used in the deblocking filter process islimited to be 4.